Solving Sudoku with Constraint Programming

摘要：

Constraint Programming (CP) is a powerful paradigm for modeling and solving Complex Combinatorial Problems (generally issued from Decision Making).In this work,we model the known sudoku puzzle as a Constraint Satisfaction Problems and solve it with CP comparing the performance of different Variable and Value Selection Heuristics in its Enumeration phase.We encourage this kind of benchmark problem because it may suggest new techniques in constraint modeling and solving of complex systems,or aid the understanding of its main advantages and limits.

作者: Broderick Crawford Carlos Castro Eric Monfroy

作者单位: Pontificia Universidad Católica de Valpara(i)so,Chile and Universidad Técnica Federico Santa Mar(i)a Universidad Técnica Federico Santa Mar(i)a,Chile LINA,Université de Nantes,Nantes,France and Universidad Técnica Federico Santa Mar(i)a,Valpara(i) so

会议类型: 国际会议

会议名称: The Ninth International Workshop on Meta-Synthesis Complez Systems(第九届综合集成与复杂国际研讨会)

会议地点: 成都

会议语种:英文

页码: 31-34

在线出版日期: 2009-06-21（万方平台首次上网日期，不代表论文的发表时间）