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.
|Number of pages||6|
|Publication status||Published - 1 Dec 2007|
|Event||Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings - |
Duration: 1 Dec 2007 → …
|Conference||Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings|
|Period||1/12/07 → …|
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