Title :
Using Constraint Programming to solve Sudoku Puzzles
Author :
Crawford, Broderick ; Aranda, Mary ; Castro, Carlos ; Monfroy, Eric
Abstract :
In constraint programming, enumeration strategies are crucial for resolution performances. In this work, we model the known NP-complete problems Latin Square, Magic Square and Sudoku as a constraint satisfaction problems. We solve them with constraint programming comparing the performance of different variable and value selection heuristics in its enumeration phase.
Keywords :
combinatorial mathematics; computational complexity; constraint handling; constraint theory; game theory; Latin Square; Magic Square; NP-complete; Sudoku puzzle; combinatorial problem; constraint programming; constraint satisfaction problem; enumeration strategy; value selection heuristics; variable selection heuristics; Constraint optimization; Information technology; Input variables; Labeling; NP-complete problem; Software performance; Constraint Programming; Constraint Satisfaction Problems; Enumeration Strategies;
Conference_Titel :
Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on
Conference_Location :
Busan
Print_ISBN :
978-0-7695-3407-7
DOI :
10.1109/ICCIT.2008.154
