Enumeration strategies in constraint programming for solving puzzles

BRODERICK CRAWFORD LABRIN, Mary Aranda, Carlos Castro, Eric Monfroy

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

Abstract

Constraint Programming is one of the major contributions of Computer Science for solving problems of high complexity. This paradigm is used to represent a wide variety of problems that can be modeled like Constraint Satisfaction Problems and solving them via Constraint Propagation and Enumeration. In this work, we study the resolution of puzzles with this approach, we evaluate the performance of different variable and value selection heuristics in the Enumeration phase. It is demonstrated the relevance of the Enumeration Strategy in a Constraint Programming process.

Original languageEnglish
Title of host publicationElectr., Rob. Autom. Mech. Conf., CERMA - Proc.
Pages718-723
Number of pages6
DOIs
StatePublished - 1 Dec 2007
EventElectronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Cuernavaca, Morelos, Mexico
Duration: 25 Sep 200728 Sep 2007

Publication series

NameElectronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings

Conference

ConferenceElectronics, Robotics and Automotive Mechanics Conference, CERMA 2007
CountryMexico
CityCuernavaca, Morelos
Period25/09/0728/09/07

Fingerprint Dive into the research topics of 'Enumeration strategies in constraint programming for solving puzzles'. Together they form a unique fingerprint.

Cite this