Sudoku as a SAT Problem

@inproceedings{Lynce2006SudokuAA,
  title={Sudoku as a SAT Problem},
  author={In{\^e}s Lynce and Jo{\"e}l Ouaknine},
  booktitle={ISAIM},
  year={2006}
}
Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding and the extended encoding. The minimal encoding suffices to characterize Sudoku puzzles, whereas the… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 101 citations. REVIEW CITATIONS
66 Citations
10 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 66 extracted citations

102 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 102 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…