Using Constraint Programming to solve Sudoku puzzles

Broderick Crawford, Mary Aranda, Carlos Castro, Eric Monfroy

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

11 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Pages926-931
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 - Busan, Korea, Republic of
Duration: 11 Nov 200813 Nov 2008

Publication series

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

Conference

Conference3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Country/TerritoryKorea, Republic of
CityBusan
Period11/11/0813/11/08

Fingerprint

Dive into the research topics of 'Using Constraint Programming to solve Sudoku puzzles'. Together they form a unique fingerprint.

Cite this