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.
Enumeration Strategies in Constraint Programming for Solving Puzzles
2007-09-01
231561 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Constraint logic programming for solving a sheduling problem
British Library Online Contents | 1996
|On solving 2D and 3D puzzles using curve matching
IEEE | 2001
|On Solving 2D and 3D Puzzles Using Curve Matching
British Library Conference Proceedings | 2001
|General Adaptive Guidance Using Nonlinear Programming Constraint-Solving Methods
Online Contents | 1993
|