@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"
}

{"_id":"5QsaA2CpTwjSiSaHg","bibbaseid":"anonymous-usingconstraintprogrammingtosolvesudokupuzzles-2008","downloads":0,"creationDate":"2017-03-31T20:15:32.913Z","title":"Using Constraint Programming to solve Sudoku puzzles","author_short":null,"year":2008,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","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","bibtex":"@inproceedings{10.1109/ICCIT.2008.154,\n 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.\",\n year = \"2008\",\n title = \"Using Constraint Programming to solve Sudoku puzzles\",\n volume = \"2\",\n pages = \"926-931\",\n doi = \"10.1109/ICCIT.2008.154\",\n journal = \"Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008\"\n}\n\n","key":"10.1109/ICCIT.2008.154","id":"10.1109/ICCIT.2008.154","bibbaseid":"anonymous-usingconstraintprogrammingtosolvesudokupuzzles-2008","urls":{},"downloads":0,"html":""},"search_terms":["using","constraint","programming","solve","sudoku","puzzles"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}