Using Constraint Programming to solve Sudoku Puzzles

Authors:
Broderick Crawford;Mary Aranda;Carlos Castro;Eric Monfroy
Affiliations:
-;-;-;-
Venue:
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 02
Year:
2008

Citing 0
Cited 1

A hybrid AC3-tabu search algorithm for solving Sudoku puzzles

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.