Using Constraint Programming to solve Sudoku Puzzles

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.

[1]  Miguel A. Salido,et al.  Introducción a la programación de restricciones , 2003, Inteligencia Artif..

[2]  Toni Mancini,et al.  SAT as an Effective Solving Technology for Constraint Problems , 2006, ISMIS.

[3]  Barbara M. Smith,et al.  Value Ordering for Finding All Solutions , 2005, IJCAI.

[4]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[5]  Rhyd Lewis,et al.  Metaheuristics can solve sudoku puzzles , 2007, J. Heuristics.

[6]  P. Zoeteweij,et al.  Composing constraint solvers , 2005 .

[7]  Broderick Crawford,et al.  Adaptive Enumeration Strategies and Metabacktracks for Constraint Solving , 2006, ADVIS.

[8]  J. Christopher Beck,et al.  Toward Understanding Variable Ordering Heuristics for Constraint Satisfaction Problems , 2003 .

[9]  Edward P. K. Tsang,et al.  Adaptive Constraint Satisfaction: The Quickest First Principle , 1996, ECAI.

[10]  T. Yato,et al.  Complexity and Completeness of Finding Another Solution and Its Application to Puzzles , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  H. Simonis,et al.  Sudoku as a Constraint Problem , 2005 .

[12]  Helmut Simonis,et al.  Constraint Handling in an Integrated Transportation Problem , 2000, IEEE Intell. Syst..

[13]  Broderick Crawford,et al.  Using Local Search for Guiding Enumeration in Constraint Solving , 2006, AIMSA.

[14]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[15]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[16]  Carlos Castro,et al.  An Approach for Dynamic Split Strategies in Constraint Solving , 2005, MICAI.

[17]  Carlos Castro,et al.  A Cooperative Framework Based on Local Search and Constraint Programming for Solving Discrete Global Optimisation , 2004, SBIA.