Using Constraint Programming to solve Sudoku Puzzles

@article{Crawford2008UsingCP,
  title={Using Constraint Programming to solve Sudoku Puzzles},
  author={Broderick Crawford and Miguel Aranda and Carlos Castro and Eric Monfroy},
  journal={2008 Third International Conference on Convergence and Hybrid Information Technology},
  year={2008},
  volume={2},
  pages={926-931}
}
In constraint programming, enumeration strategies are crucial for resolution performances. In this work, we model the known NP-complete problems Latin Square, Magic Square and Sudoku as a constraint satisfaction problems. We solve them with constraint programming comparing the performance of different variable and value selection heuristics in its enumeration phase. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…