A Sudoku-Solver for Large Puzzles using SAT

6 pages•Published: March 25, 2013

Uwe Pfeiffer, Tomas Karnagel and Guido Scheffler

Abstract

n<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.

Links:	https://easychair.org/publications/paper/VF3m
	https://doi.org/10.29007/79mc

BibTeX entry

@inproceedings{LPAR-17-short:Sudoku_Solver_Large_Puzzles,
  author    = {Uwe Pfeiffer and Tomas Karnagel and Guido Scheffler},
  title     = {A Sudoku-Solver for Large Puzzles using SAT},
  booktitle = {LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.},
  editor    = {Andrei Voronkov and Geoff Sutcliffe and Matthias Baaz and Christian Fermüller},
  series    = {EPiC Series in Computing},
  volume    = {13},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/VF3m},
  doi       = {10.29007/79mc},
  pages     = {52-57},
  year      = {2013}}

Download PDF Open PDF in browser