Solving sudoku with constraint programming

BRODERICK CRAWFORD LABRIN, Carlos Castro, Eric Monfroy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationCutting-Edge Research Topics on Multiple Criteria Decision Making
Subtitle of host publication20th International Conference, MCDM 2009, Chengdu/Jiuzhaigou, Proceedings
Pages345-348
Number of pages4
DOIs
StatePublished - 14 Aug 2009

Publication series

NameCommunications in Computer and Information Science
Volume35
ISSN (Print)1865-0929

Fingerprint Dive into the research topics of 'Solving sudoku with constraint programming'. Together they form a unique fingerprint.

Cite this