Using Constraint Programming to solve Sudoku puzzles

Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008

Volumn 2, Issue , 2008, Pages 926-931

  Crawford, Broderick ^a   Aranda, Mary ^a   Castro, Carlos ^b   Monfroy, Eric ^b,c  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE VALPARAÍSO   (Chile)

^b DEPARTAMENTO DE FÍSICA   (Chile)

^c UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; INFORMATION TECHNOLOGY; NUMBER THEORY;

COMPLETE PROBLEMS; CONSTRAINT PROGRAMMINGS; CONSTRAINT SATISFACTION PROBLEMS; SUDOKU PUZZLES;

CONSTRAINT THEORY;

EID: 57849140148     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIT.2008.154     Document Type: Conference Paper

References (21)

1. K. Apt. Principles of constraint programming, 2003.
2. F. Barber and M. A. Salido. Introducción a la programación de restricciones. Inteligencia Artificial, Revista Ibewamericana de Inteligencia Artificial, 20:13-30, 2003.
3. R. Bartk. On-line guide to constraint programming. 1998. http://kti.mff.cuni.cz/bartak/constraints/.
4. C. Beck, P. Prosser, and R. Wallace. Toward understanding variable ordering heuristics for constraint satisfaction problems. In Fourteenth Irish Artificial Intelligence and Cognitive Science Conference - AICS 2003, pages 11-16.
5. J. Borrett, E. Tsang, and N. Walsh. Adaptive constraint satisfaction: The quickest first principle. In W. Wahlster, editor, ECAI, pages 160-164. John Wiley and Sons, Chichester, 1996.
6. M. Cadoli, T. Mancini, and F. Patrizi. Sat as an effective solving technology for constraint problems. In F. Esposito, Z. Ras, D. Malerba, and G. Semeraro, editors, ISMIS, volume 4203 of Lecture Notes in Computer Science, pages 540-549. Springer, 2006.
7. C. Castro, E. Monfroy, C. Figueroa, and R. Meneses. An approach for dynamic split strategies in constraint solving. In A. F. Gelbukh, A. de Albornoz, and H. Terashima-Marín, editors, MICAI, volume 3789 of Lecture Notes in Computer Science, pages 162-174. Springer, 2005.
8. C. Castro, M. Moossen, and M.-C. Riff. A cooperative framework based on local search and constraint programming for solving discrete global optimisation. In A. Bazzan and S. Labidi, editors, SBIA, volume 3171 of Lecture Notes in Computer Science, pages 93-102. Springer, 2004.
9. R. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
10. T. Lambert, E. Monfroy, and F. Saubion. Solving sudoku with local search: A generic framework, May 28-31 2006. A paratre.
11. R. Lewis. Metaheuristics can solve sudoku puzzles. In Press: Journal of heuristics, 13, 2007.
12. E. Monfroy, C. Castro, and B. Crawford. Adaptive enumeration strategies and metabacktracks for constraint solving. In T. M. Yakhno and E. J. Neuhold, editors, ADVIS, volume 4243 of Lecture Notes in Computer Science, pages 354-363. Springer, 2006.
13. E. Monfroy, C. Castro, and B. Crawford. Using local search for guiding enumeration in constraint solving. In J. Euzenat and J. Domingue, editors, AIMSA, volume 4183 of Lecture Notes in Computer Science, pages 56-65. Springer, 2006.
14. G. Royle. Minimum sudoku. http://www.csse.uwa.edu.au/gordon/sudoku17.
15. H. Simonis. Sudoku as a constraint problem. In B. Hnich, P. Prosser, and B. Smith, editors, Proc. 4th Int. Works. Modelling and Reformulating Constraint Satisfaction Problems, pages 13-27, 2005.
16. B. Smith. Succeed-first or Fail-first: A Case Study in Variable and Value Ordering. Technical Report 96.26, 1996.
17. B. M. Smith and P. Sturdy. Value ordering for finding all solutions. In L. P. Kaelbling and A. Saffiotti, editors, IJCAI, pages 311-316. Professional Book Center, 2005.
18. The Times. Spring su doku. April 2007.
19. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London, 1993.
20. T. Yato and T. Seta. Complexity and completeness of finding another solution and its application to puzzles. IPSJ SIG Notes, 2002(103):9-16, 20021108.
21. P. Zoeteweij. Composing Constraint Solvers. Printed and bound by PrintPartners Ipskamp, Enschede, 2005.