started at . submit by
stop the presses, I'm actually on time! your task is unfortunately to sat solve. submissions may be written in any language.
a boolean formula is one consisting of some number of boolean variables combined with the AND/OR/NOT operators. to "satisfy" one, you have to find an assignment for each variable in the formula that causes it to be true. for instance, (x OR y) AND NOT (x AND y) is satisfied by x = true, y = false (or the other way around).
the boolean satisfiability problem (SAT) is to determine whether or not a boolean formula can be satisfied in this way, i.e. whether or not it is possible for the expression to evaluate to true.
a SAT solver is a program that accomplishes this task, and your challenge is to create one. as any language is allowed, there is no fixed API.
0 entries have been received so far.