| Author | Average scores | Description |
| Cnf-0 | Cnf-1 | Avg |
| * | 13a | 15.00 | 15.00 | 15.00
| Combination of clothes (shirts, pants, socks): constant clauses are each day must have one and only one article of each type of clothing, and shirts and socks can't be repeated. The varied clauses are randomly chosen sets of pants and socks that can be worn with each shirt, chosen by iterating through clothing and comparing a randomly generated double to a threshold of .05. It is not necessarily solvable.
|
| * | Supahaka | 15.00 | 15.00 | 15.00
| You have n each of boots, pants, shirts, ties, jackets, and hats. You are a secret agent going to the traffic-light nation, and you need n traffic-light outfits (has red, yellow, and green clothes) to disguise as a traffic light every day. An outfit must have Boots, Pants, Shirt and exactly two of Tie, Jacket, Hat.
|
| * | Deric Cheng | 15.00 | 15.00 | 15.00
| This generator implements an ordering for electronic artists performing at Ultra Music Festival. Given a number of genres, artists playing per genre, stages, and performance times, it finds a satisfying assignment for each artist to play at the concert.
|
| * | SuperFan | 15.00 | 15.00 | 15.00
| This generator generates an instance of a problem of the 'Flow' game. The game has a grid, and various different colored pairs of start points, and the object is to make paths connecting each pair of points. The puzzles generated are not always solvable.
|
| * | Aristotle | 15.00 | 14.94 | 14.97
| Hamiltonian cycle CNF from a graph with 120 nodes and 1700 edges.
|
| * | Mark S. Fillmore | 14.80 | 14.81 | 14.80
| This generator attempts to specify an instance of a seating problem for a wedding reception, but it does so in a manner that is unsatisfiable. This is due to a difficulty in writing CNF statements such as (X^Y^Z) V (X^Y^~Z).
|
| 1 | CookieMonster | 14.69 | 14.76 | 14.73
| PrisonBreak is a random satisfiable cnf generator which is a reduction of a prisoner trying to avoid searchlights as he makes his escape towards a goal. The prison yard (represented linearly, as a straight dashtowards the exit) is given a certain size, and the prisoner has a certain amount of time to reach the exit before the hounds areset loose. Finally, a certain number of searchlights constantlysweep different points in the yard. The prisoner must make hisway to the exit within the alloted number of time steps, withoutever occupying the same space as a searchlight.
|
| * | Jessie Chen | 14.66 | 14.39 | 14.52
| Dinnertable problem generator. Generates clauses for a valid dinner table for 8 pairs and hosts and with 5 rules as to who can or can't sit with whom.
|
| 2 | Aaron Doll | 14.22 | 14.71 | 14.46
| This generator creates a directed graph with a validHamiltonian path, and then reduces finding a Hamiltonian pathto satisfying a CNF. For a graph with v vertices, there are v^2variables, each representing whether a specific node is in aspecific position in the path.
|
| 3 | Dusty | 14.12 | 13.54 | 13.83
| This sudoku generator has the original rules of sudoku pre-generated in the form of a cnf, and then spawns 16 new initial clues for the puzzle. These 16 clues are then added to the cnf as new single positive literal clauses. 16 was chosen because it is the cutoff for which a solution always exists (no longer unique)
|
| 4 | Nihar the Great | 13.78 | 13.74 | 13.76
| This generator generates a model of a class scheduler. The dimensions approximately model those at Princeton, with 5000 students signing up for 1000 classes in 15 spots (5 days a week, morning, afternoon, and evening). Each student is signed up for 4 classes, and no two classes can be at the same time. There is a random distribution of schedules.
|
| 5 | Shaheed Chagani | 13.76 | 13.72 | 13.74
| Exam Scheduler which schedules 500 exams in 15 days with a maximum of 5 conflicts between each class.
|
| 6 | Absurdity | 13.60 | 13.72 | 13.66
| Generates instances of the Hamiltonian cycle problem with 35 vertices.
|
| 7 | AFC | 13.64 | 13.46 | 13.55
| Generates CNF formulas for the dinner party planning problem.
|
| * | Bar Shabtai | 15.00 | 12.01 | 13.51
| My generator tackles the problem of scheduling I different classes in J differet classrooms in one hour intervals between X and Y o'clock. Obviously, two classes cannot be scheduled in the same room at the same time. To add to the difficulty, classes randomly conflict with each other. For example, it's possible that class I can't be scheduled at the same time as class J regardless of the room.The generator has three sets of nested for loops. the first creates clauses for instances where there are two classes scheduled at the same time and in the same room. The second set takes care of instances where there are conflicting classes scheduled at the same time, regardless of the room the final set makes sure every class is scheduled at least once. The format of each literal is (I, J, X), where X is the start time of the class.
|
| 8 | Elphaba | 13.46 | 13.42 | 13.44
| This generates carpool planning problems.
|
| 9 | Matt Goldsmith | 13.31 | 13.44 | 13.37
| My generator simulates a long table of 80 people, many of whom are involved in confusing, polygamous love n-gons and therefore have some people they demand to sit next to. However, many others have dark, complicated histories with each other so they demand to sit apart from each other. My algorithm generates sets of these needy, melodramatic guests and their pseudo-randomized demands.
|
| * | T. Capote | 13.19 | 13.47 | 13.33
| This generator creates CNF formulas, by first creating a random graph on a random number of vertices between 50 and 150. The cnf generator corresponds to finding whether there exists a clique in the graph of size greater than or equal to 2*log2(V).
|
| 10 | spl | 13.34 | 13.23 | 13.28
| Dinner party problem with 21 guests. Each guest must be seated with 0, 1, or 2 other guests, and may be hostile with up to several of the the other guests. All CNFs are satisfiable, because the guests are assigned to seats first and the constraints are placed afterwards.
|
| 11 | jgs | 13.01 | 12.81 | 12.91
| This generator creates a random graph and then reduces the problem of finding a Hamilton cycle into a CNF satisfiability problem. It guarantees satisfiability by ensuring that the graph be connected and conform to the conditions of Ore's theorem, which guarantees the existence of a Hamilton cycle
|
| * | Charliezsc | 15.00 | 10.15 | 12.58
| Generates random CNF formulas for Dinner Party Planning Problem: 40 maximum guests, and 30 minimum guests.
|
| 12 | CAPS LOCK | 11.63 | 13.39 | 12.51
| This generator produces CNFS based on state machines where every state is visited only one time. This is essentially a Hamiltonian circuit. The problems are generated by creating a cycle in a graph and then removing some extraenous edges before finally converting the result to a CNF.
|
| 13 | Andrew Grasso | 11.77 | 12.97 | 12.37
| Generates a random 9x9 Sudoku Board.
|
| 14 | nupog | 12.46 | 12.27 | 12.37
| This generator is based of the k-Independent Set problem and produces 3-SAT problems with 40000 clauses and 3 symbols.
|
| 15 | Andys | 12.30 | 12.27 | 12.28
| Wedding party planner
|
| 16 | Andrew Werner | 12.16 | 12.01 | 12.08
| The generator makes CNFs that are reductions from the problem of placing people at seats in a dinner party. There are 50 guests and 50 seats and each guest has a 20% chance of having a preference to sit next to another guest. The problem is always satisfiable because these preferences are taken from a true possible arrangement.
|
| 17 | David H. | 11.51 | 12.32 | 11.91
| generates satisfiable problems by reducing Hamiltonian Path problems
|
| 18 | BH | 12.10 | 11.44 | 11.77
| Wedding party planning: Guests have to be seated on tablesso that friends are seated together and enemies are seatedon separated tables. Guests are randomly distributed on tablesand random friend/enemy relationships are created. The problemis converted to satisfiable CNF.
|
| 19 | Walter Little | 12.00 | 11.53 | 11.77
| This generator generates random CNF formulas correspondingto a Sudoku 9x9 board with 20 cells filled in.
|
| * | Yacob Y. | 8.38 | 15.00 | 11.69
| My generator generates CNF sentences that correspond to solving the problem of Hamiltonian cycles. We define a Hamiltonian cycle to be a path through a given directed graph such that the path visits every vertex once
|
| 20 | NA | 12.34 | 10.81 | 11.58
| Sudoku Puzzle
|
| 21 | John Whelchel | 10.32 | 12.49 | 11.40
| This CNF generator returns a CNF that describes the course registrar problem; that is, where should each class be taught based on classroom sizes and times of day. The default values are for a small school, i.e. 5 classrooms and 40 classes, spread across 8 class times during the week. Larger problems demand much larger times to process.
|
| 22 | ebp | 11.22 | 11.35 | 11.29
| Models a tiling game where each side has a color and must be placed on a square board so that adjacent tiles have matching colors.
|
| 23 | Valya Barboy | 10.75 | 11.49 | 11.12
| Generates CNFs using the dinner seating problem. Assuming there is a table seating R people, and R spaces, and people have seating preferences, generates a CNF to represent the constraints. Guaranteed to be satisfiable. A solution to the CNF represents a seating that suits everyone.
|
| 24 | Mike Hunt | 10.72 | 11.32 | 11.02
| Dinner party planning with 46 people who really, really dislike each other
|
| 25 | Ben Chen | 10.44 | 10.89 | 10.67
|
|
| 26 | jabreezy | 10.30 | 10.69 | 10.49
| Generates a cnf describing a jigsaw puzzle with default dimensions 4 X 4 and default number of sides 4. The default number of possible side values is 20. The default implementation creates a CNF that MUST be satisfied with the correct solution generated by the random jigsaw puzzle generator.
|
| 27 | snowflakes | 10.37 | 10.17 | 10.27
| Generates a cnf sentence corresponding to a solvable sudoku
|
| 28 | Mr. Blobby | 10.12 | 10.27 | 10.19
| Mr. Blobby's CNF generator constructs an instance of a 9 x 9 sudoku puzzle that is guaranteed to be satisfiable.
|
| 29 | Sabar Dasgupta | 10.27 | 9.92 | 10.10
| Generates a Cnf to model the Wedding Party problem with 2 tables and 20 seats each. Includes restrictions so that some guests are paired together and some are paired apart
|
| 30 | EC | 10.34 | 9.78 | 10.06
| Dinner Party Problem w/ a round table and no hosts. Each person (A) has one other person (B) that person(A) must be placed with, and two other people (C, D) that person (A) cannot be placed with.
|
| * | DeeEmEm | 14.98 | 4.59 | 9.78
| Two groups of people at a dance select members of the other group they'd like to dance with. 10 people per group, each choose between 4 and 6 from other group.
|
| 31 | Fanny | 9.91 | 9.49 | 9.70
| This is a CNF generator based on the extension of the Rummikub game.For any legal combinations, if the colors for any two postions are different, this array must be consisted of the same symbol/number.If the colors of any of the two positions are the same, the symbols/numbers within the set must be in a(n) increasing/decreasing order.
|
| * | 0108 | 15.00 | 4.26 | 9.63
| Dinner party planning with n guests at n chairs. Each guestwants to be together with another guest (chosen randomly) with someprobability, and each guest wants to be separated from another guestin the same way.
|
| 32 | Anon5 | 10.61 | 8.46 | 9.54
| For my generator I used the Hamiltonian cycle problem. I first generate a random graph containing a Hamiltonian cycle. Then, I convert it to CNF by using the literals H(i,j), where H(i,j) is true if vertex i is in the jth position of the hamiltonian cycle.
|
| 33 | burrito | 7.11 | 11.29 | 9.20
| Emulates a real-life problem of scheduling music acts at a concert. We have a fixed number of genres, acts per genre, stages, and time slots. Here are the four constraints that we turned into clauses:
- Every act should perform at least on one stage at one time.
- Every act can perform at most on one stage and one time.
- Every stage can have at most one act at any time.
- Acts of the same genre cannot play during the same time slot.
|
| * | Qinlan Shen | 3.21 | 14.93 | 9.07
| This is a generator for the wedding guests problem. For the wedding guests problem, the generator generates the number of tables, the capacity of each table, the number of guests, and guest relations based on given probabilities. The goal is to seat every two guests with a good relationship not at the same table, and every person with a bad relationship not at the same table.
|
| 34 | Aaron H | 8.95 | 9.11 | 9.03
| This generator creates CNF formulas representing an instance of the Hamiltonian path problem. In this problem, the Sat solver seeks to find a path in a connected graph that visits each vertex exactly once
|
| 35 | Glenn Fisher | 7.33 | 10.72 | 9.02
| Each CNF represents the rules and starting configuration of a randomly generated Sudoku board.
|
| * | Quite Satisfied | 2.05 | 14.80 | 8.43
| Wedding Dancing problem. Guests separate into an arbitrary numberof circles to dance with each other. They have requests of who they must stand nextto in the circle and who they will not be next to. No person can dance alone, soevery circle must have at least two people.
|
| 36 | Brendan Wright | 8.63 | 8.23 | 8.43
| Generates a CNF to describe a Hamiltonian-cycle finding problem. The CNF will always be satisfiable.
|
| 37 | dfshasdsf12 | 6.88 | 9.26 | 8.07
| This generator simulates the CNF formula of a dinner planning problem, with individuals wanting to or refusing to sit next to others.
|
| 38 | Matt Haake | 8.02 | 8.08 | 8.05
| Generates CNF formulas for random 9x9 Sudoku puzzles with a few numbers randomly filled in.
|
| 39 | DinnerPartyPlannerBM | 9.66 | 6.24 | 7.95
| This generator produces satisfiable dinner party planning occurences with 40 to 60 guests. Pairs of guests are randomly chosen with some probability to either like or dislike each other to constrain the seating arrangements
|
| 40 | Yan Wu | 7.71 | 8.11 | 7.91
| This generator generates a satisfiable CNF that represents a protein regulation problem. There are 4 classes of proteins, and the problem reduces to a variation of the graph coloringproblem.
|
| 41 | Tao | 7.30 | 7.47 | 7.39
| It generates an instance of the wedding problem. All instances are satisfiable.
|
| 42 | Lil Thug | 7.24 | 7.22 | 7.23
| Generates a CNF from the dining party problem.
|
| 43 | soccer | 6.65 | 7.06 | 6.86
| This generator produces a random SAT problem that findsthe topological ordering of a directed graph's vertices. In orderto ensure that a satisfiable instance is always produced, the random graph produced is always a directed acyclic graph, which always has a topological ordering.
|
| 44 | Mercury | 6.70 | 6.70 | 6.70
| This generator produces satisfiable instances of the Hamiltonian circuit problem on random graphs. The default constructor produces a graph of 24 vertices with a 33% chance of an edge between every pair of vertices. An assignment that satisfies the cnf will indicate vertex 'i' of the circuit is on vertex 'j' of the underlying graph for every literal i,j that is true.
|
| 45 | Anon_K_P | 6.72 | 6.29 | 6.51
| Generates satisfiable CNF formulas based on a table configuration with n seats on each of two sides, 2n people, and various constraints regarding which pairs of people cannot sit across from or adjacent to one another.
|
| 46 | Sprt | 7.65 | 5.14 | 6.39
| Generates CNF formulas for the real world situation of holiday-season gift giving. Randomly generates a number of gifts, number of recipients, number of small gifts and number of large gifts and produces a formula to ensure that each recipient has at least 1 gift, at least 2 if the gifts are small and certainly no more than 1 if the gifts are large.
|
| 47 | bfang | 6.04 | 6.01 | 6.02
| Returns satisfiable CNFs that correspond to the problem of finding
a Hamilton cycle in a random graph with a fixed number of vertices.
|
| 48 | KingBach | 6.69 | 5.35 | 6.02
| Represents the dinner table starting with 30 people. Selects two at random to be hosts. Then selects a random number of pairs and alternates making enemy pairs (can't sit next to each other), and friend pairs (must sit next to each other
|
| 49 | Samuel Jerome | 5.42 | 6.39 | 5.91
| This is the dinner party problem, as per the assignment spec. The host and hostess sit at the front of the table, and the rest of the people sit around in a circle. Some dislike each other and cannot sit together with probability .1, and some love each other and must sit together with probability .03
|
| 50 | Khoa | 5.87 | 5.91 | 5.89
| An implementation of the wedding party planning problem
|
| 51 | Batman | 5.97 | 5.75 | 5.86
| Generates a CNF that represents the problem of assigning seats to airplane/train passengers so that every passenger gets one seat, and couples have adjacent seats.
|
| 52 | AARON BURR, DROPPIN' HAMILTONS | 5.59 | 5.66 | 5.62
| This generator makes random graphs with Hamilton cycles.
|
| 53 | Keji Xu | 5.69 | 5.55 | 5.62
| This generates a CNF based on 17 vertices on the graph for a hamiltonian cycle problem
There's also a 0.5 chance a vertex will share an edge with another vertex
|
| 54 | Nikhilesh Sigatapu | 5.46 | 5.57 | 5.52
| Generates a satisfiable CNF corresponding to an instance of the Hamiltonian path problem.
|
| 55 | Janie Gu | 5.64 | 5.25 | 5.44
| This generator creates CNF formulas representing randomly-generated Sudoku puzzle problems.
|
| 56 | Lisa Kim | 5.82 | 4.89 | 5.35
| Students are going on a trip on a small school bus (minotour)
with 7 rows of 4 seats for the students and 2 seats for
the supervisers. Some want to sit in the back, in the
front, by the window, or by the aisle.
Some don't want to sit together (the bus has two-seater
seats). Find an appropriate arrangement.
|
| 57 | Sally Smith | 5.20 | 5.49 | 5.34
| Animals are placed in cages where only one animal can be in a cage and each animal selected must be in a cage. Some animals should be far away from other specific animals and some should be close other animals.
|
| 58 | The Whitman Whale | 5.27 | 5.26 | 5.26
| A dinner-party based cnf generator. Creates cnfs that are equivalent to a dinner party with 20 guests at a circular table, with 40 illegal adjacencies.
|
| 59 | kt4124 | 5.11 | 5.30 | 5.20
| Problem: Given an empty NxN zoo with different habitats, place an animal in each habitat such that lions and antelope reside in grassland habitats, owls and mice reside in forest habitats and sharks and fish reside in water habitats. Ensure that predatory animals are not placed adjacent to their prey (i.e. lions and antelopes, owls and mice, or sharks and fish).
|
| 60 | David Lackey | 4.71 | 4.83 | 4.77
| Generates random CNF formulas based on the Wedding Party Planning problem.
|
| 61 | Jordan Ash | 5.49 | 3.95 | 4.72
| This generator creates a random Hamiltonian graph with between 3 and 15 vertices. It then formulates a problem in the form of a CNF such that a correctvariable assignment describes a Hamiltonian path (a path that visits each vertex).
|
| 62 | Alex Fish | 4.45 | 4.27 | 4.36
| My generator generates sets of CNF clauses corresponding to "dinner party" problems. I formalize the dinner party problem as one in which n people must sit at a circular table with n seats, and certain pairs of people must sit next to one another, and certain pairs of people must not sit next to one another. My generator generates problems with n = 2 chairs and people.
|
| 63 | Sunny | 4.18 | 3.91 | 4.04
| This is the farmer sheep, cabbage, and wolf problem: The farmer wants to carry his sheep, cabbage and wolf across the river, but he can only carry 1 at a time using his boat.If the farmer is not present, the sheep will eat the cabbage and the wolf will eat the sheep
|
| 64 | cat | 3.68 | 3.77 | 3.72
| How to seat guests around a circular table given two constraints (a must sit with b and b will not sit with c).
|
| 65 | George Okeowo | 3.77 | 3.68 | 3.72
| This generator creates 9x9 traditional Sudoku puzzles reduced into CNF formulas.
|
| 66 | Jameh | 3.20 | 4.09 | 3.64
| Generates satisfiability problems faced by the Sorting Hat of Hogwarts School of Witchcraft and Wizardry. Sorts a number of students into the four houses: Gryffindor, Hufflepuff, Ravenclaw and Slytherin.
|
| 67 | totallyOnFallBreak | 3.60 | 3.44 | 3.52
| produces CNF sentences that represent acceptable academic course scheduling.
|
| 68 | Tiny Wings | 3.09 | 3.80 | 3.44
| Dinner party planning (# of people = 15, # of like pairs = 1, # of hate pairs = 3)
|
| 69 | Linda | 2.70 | 3.82 | 3.26
| Generates 18000 clauses over 100symbols. There are 4 literals per clause.
|
| 70 | haoyu | 3.23 | 3.15 | 3.19
| Solve the ordering reagents problem for chemical experiments.
|
| 71 | Ytterbium | 2.63 | 3.37 | 3.00
| This generator produces sentences from instances of the dinner party planning problem. The clauses are guaranteed to be satisifiable.
|
| 72 | vluu | 2.92 | 2.96 | 2.94
| This is an encoding of the natural problem of assigning guests to a table. Some guests must sit next to each other, some can't sit next to each other and some would like to sit within 3 or 4 seats of each other. An arrangement is randomly generated and CNF constraints are drawn from that.
|
| 73 | Dr Roberto | 2.97 | 2.64 | 2.81
| Generates cnf formulas based on the real problem of having to purchase 6 types of objects having a choice of 48 random objects and having to spend less than 60 dollars
|
| 74 | Tree Prophet | 2.34 | 3.22 | 2.78
| This generator generates Christmas shopping problems in which a set of children each specify 3 presents. The "angel" children who have been really good specify one present they really want or (up to) two second best, forming a constraint of the form P1 v (P2 ^ P3). The average child will specify one present he really wants and (up to) two he absolutely doesn't want, forming a constraint of the form P1 v (~P2 ^ ~P3). And the "naughty" child will specify one present he really doesn't want or (up to) two other presents that he really doesn't want, forming a constraint of the form ~P1 v (~P2 ^ ~P3). These clauses are converted to CNF form using the law of distribution. The number of children (200) and presents(400) are static and the percentage of angel (20%) and naughty children (30%) are stati such that the actual number of naughty and angel children change with each iteration but the total number of children and presents to select from are constant.
|
| 75 | The Kraken | 2.59 | 2.59 | 2.59
| This generator creates a CNF that represents a variant of the dinner table problem. First it creates large clauses to ensure everyone is seated. Then it ensures no seat is occupied twice. Then it takes care of specific pairs.
|
| 76 | weezy | 2.43 | 2.65 | 2.54
| Generates cnf clauses dictating the guidelines for selecting from 220 courses of 4 different subjects and 5 time blocks.
|
| 77 | Mickey Mouse | 2.47 | 2.32 | 2.39
| Creates an arrangement of students in a circle in a classroom. Does not allow students who dislike other students to sit next to the students they dislike, and sits friends next to one of their friends
|
| 78 | Boomshanka | 1.95 | 2.72 | 2.33
| Generates a CNF instance based off the rules of a chess tournament. Implements rules such as each player having 1 and only 1 rating, and two players of the same rating must play each other, and two players of different ratings cannot play each other.
|
| 79 | Blam | 2.41 | 2.10 | 2.26
| This creates a cnf that asks if there is a path between a graph'sfirst and last nodes. (Note: This is really any two nodes with reindexing). The cnf includes all of the nodes and edges and determines if there is a pathbetween node 0 and node n if and only if (there is an edge between 0 and n) or if((nodes 0 and n are connected) and (there is an edge between x and n))
|
| 80 | R. A. B. | 2.51 | 0.94 | 1.73
| Wedding Party Problem. There are many tables of fixed size which must seat all guests, but some pairs of guests must be at the same table, where others must be separated
|
| 81 | Bob Dondero | 1.64 | 1.79 | 1.71
| Represents a color-picking problem: given K colors and B boxes (of varying sizes) containing crayons of various colors, what combination of boxes should I buy in order to ensure that I have at least one of every color without exceeding my goal budget G, the goal number of boxes? Guaranteed to only produce satisfiable CNFs.
|
| 82 | Tom T | 1.74 | 1.62 | 1.68
| Generates CNF sentences corresponding to the problem of planning where Colonial Club members will be seated for Houseparties. This problem can be reduced to the wedding party planning problem.
|
| 83 | Gewang | 1.65 | 1.68 | 1.67
| The generator is built from a problem of finding a path through a graph.
|
| 84 | bchouGenerator | 1.36 | 1.94 | 1.65
| Dinner Party CNF generator for between 6 and 12 people. Everyone must have exactly one seat. There are some pairs that must sit next to each other, and there are others that must sit apart.
|
| 85 | Happy | 1.99 | 1.06 | 1.52
| Generates random CNF formulas representing table arrangements for 5 people, with pairs of people who want to be next to each other and pairs who don't.
|
| 86 | David Paulk | 1.13 | 1.79 | 1.46
| My generator generates table seating problems where 'In(a,S(b,c))' denotes guest 'a' is seated in seat '(b,c)'. An assignment of guests to seats is found such that every guest is sitting next to all of his or her friends and none of his or her enemies.
|
| 87 | Daffy Duck | 1.58 | 1.26 | 1.42
| Generator is based on the Dinner Party problem. 6 people are invited to dinner and 10 random pairs of people refuse to sit next to each other.
|
| 88 | cmF5a3ly | 1.29 | 1.51 | 1.40
| Generates CNFs corresponding to wedding party problems, where guests are seated at a limited number of tables with constraints on seating some guests together
|
| 89 | K.L. | 1.76 | 1.03 | 1.39
| class projects - need to split students into even groups. Some students don't want to work together so they don't care about which project they work on. Other students want to work on a certain project. Other students really don't want to work on a certain project. Find an arrangement of students and projects.
|
| 90 | Joshua Zimmer | 1.20 | 1.36 | 1.28
| This generates CNF models corresponding to a Bar Mitzvah party where every guest can request to sit with other people or avoid other people. Every table seats a variable number of individuals and there are a fixed number of tables. The number of invited guests exactly fills up all the tables.
|
| 91 | BMJ | 1.28 | 1.07 | 1.18
| This generator creates an instance of a logic grid puzzle. There are N people living in N different houses with N different pets, with clues like 'person 1 does not live in house number 2.' CNF formulas are generated by generating a satisfied instance, then extracting limited information from it and adding it that information as new clauses to the problem.
|
| 92 | Mike Honcho | 0.96 | 1.23 | 1.09
| Returns a satisfiable cnf which represents a dinner party planning problem with a one sided table, and 10 seats, 10 guests, 1-3 together pairs, and 1-3 apart pairs
|
| 93 | Scheduling Generator 203 | 0.91 | 1.23 | 1.07
| Generates work scheduling problems- assigning workers to shifts. There are restrictions on number of workers per shift, total number of shifts per worker, and additional restrictions on which workers can work together
|
| 94 | Solving For Clauses | 0.93 | 1.20 | 1.06
| A company is sorting 70 interns into several companies who have hired this company. A certain proportion of these companies need exactly one intern, a certain proportion need two or more, and the remainder need three or more. Every intern must get exactly one job.
|
| 95 | Jonathan Kwok | 1.02 | 0.97 | 0.99
| This generator generates logic for a 3x3 latin square with either a square filled in as a constraint or a specification of what number the square cannot be.
|
| 96 | Bebe Shi | 0.65 | 0.60 | 0.62
| Generates a cnf formula that represents an instance of the Hamiltonian Path problem.
|
| 97 | bigwig | 0.40 | 0.52 | 0.46
| fill this in later i guezzz plz dun 4get
|
| 98 | Ravi Tandon | 0.44 | 0.40 | 0.42
| This is a randomized generation of a CNF for the register to variable matching problem.The number of registers is taken as 3. The number of vaiables can be as large as 13 and as minimum as 3.
|
| 99 | Miranda | 0.40 | 0.40 | 0.40
| My generator creates a cnf representing a simple sudoku puzzle. The clauses and literals represent a standard Sudoku puzzle with some squares filled in and is always satisfiable. Unlike a regular Sudoku, the generated puzzles can have multiple different solutions.
|