Solving sudoku with constraint programming

Broderick Crawford, Carlos Castro, Eric Monfroy

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

5 Citas (Scopus)

Resumen

Constraint Programming (CP) is a powerful paradigm for modeling and solving Complex Combinatorial Problems (generally issued from Decision Making). In this work, we model the known Sudoku puzzle as a Constraint Satisfaction Problems and solve it with CP comparing the performance of different Variable and Value Selection Heuristics in its Enumeration phase. We encourage this kind of benchmark problem because it may suggest new techniques in constraint modeling and solving of complex systems, or aid the understanding of its main advantages and limits.

Idioma originalInglés
Título de la publicación alojadaCutting-Edge Research Topics on Multiple Criteria Decision Making
Subtítulo de la publicación alojada20th International Conference, MCDM 2009, Chengdu/Jiuzhaigou, Proceedings
Páginas345-348
Número de páginas4
DOI
EstadoPublicada - 2009
Publicado de forma externa

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen35
ISSN (versión impresa)1865-0929

Huella

Profundice en los temas de investigación de 'Solving sudoku with constraint programming'. En conjunto forman una huella única.

Citar esto