Using Constraint Programming to solve Sudoku puzzles. In volume 2, pages 926-931, 2008.
doi  abstract   bibtex   
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. © 2008 IEEE.
@inproceedings{10.1109/ICCIT.2008.154,
    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. © 2008 IEEE.",
    year = "2008",
    title = "Using Constraint Programming to solve Sudoku puzzles",
    volume = "2",
    pages = "926-931",
    doi = "10.1109/ICCIT.2008.154",
    journal = "Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008"
}

Downloads: 0