Download PDFOpen PDF in browserA Sudoku-Solver for Large Puzzles using SAT6 pages•Published: March 25, 2013Abstractn<sup>2</sup> x n<sup>2</sup> Sudoku puzzles can be straightforwardly encoded as SAT problems. However, solving such puzzles for large n requires a significant amount of optimization. We present some ideas for reducing the number of clauses, for improving the encoding, and for the selection of suitable SAT solvers.Keyphrases: puzzle, sat, stochastic search, sudoku In: Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors). LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning., vol 13, pages 52-57.
|