Sudoku as a SAT Problem

Abstract

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… (More)

5 Figures and Tables

Topics

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

97 Citations

Semantic Scholar estimates that this publication has 97 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics