Enumeration strategies in constraint programming for solving puzzles

Broderick Crawford, Mary Aranda, Carlos Castro, Eric Monfroy

Research output: Contribution to conferencePaper

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. © 2007 IEEE.
Original languageEnglish
Pages718-723
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2007
EventElectronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings -
Duration: 1 Dec 2007 → …

Conference

ConferenceElectronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings
Period1/12/07 → …

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

  • Cite this

    Castro, C., & Monfroy, E. (2007). Enumeration strategies in constraint programming for solving puzzles. 718-723. Paper presented at Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings, . https://doi.org/10.1109/CERMA.2007.4367772