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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Enumeration Strategies in Constraint Programming for Solving Puzzles


    Contributors:


    Publication date :

    2007-09-01


    Size :

    231561 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Solving Transient Scheduling Problems with Constraint Programming

    Korbaa, O. / Yim, P. / Gentina, J.-C. | British Library Online Contents | 2000


    Constraint logic programming for solving a sheduling problem

    Baptiste, P. / Legeard, B. / Manier, M.-A. et al. | British Library Online Contents | 1996


    On solving 2D and 3D puzzles using curve matching

    Weixin Kong, / Kimia, B.B. | IEEE | 2001


    On Solving 2D and 3D Puzzles Using Curve Matching

    Kong, W. / Kimia, B. B. / IEEE | British Library Conference Proceedings | 2001