{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:46:33Z","timestamp":1764053193689},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880684"},{"type":"electronic","value":"9783540880691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88069-1_3","type":"book-chapter","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T11:30:10Z","timestamp":1224156610000},"page":"25-35","source":"Crossref","is-referenced-by-count":7,"title":["SudokuSat\u2014A Tool for Analyzing Difficult Sudoku Puzzles"],"prefix":"10.1007","author":[{"given":"Martin","family":"Henz","sequence":"first","affiliation":[]},{"given":"Hoang-Minh","family":"Truong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"AFP. Mathematician claims to have penned hardest Sudoku. USA Today (November 2006)"},{"issue":"7","key":"3_CR2","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the Association for Computing Machinery\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the Association for Computing Machinery"},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the Association for Computing Machinery\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"3_CR4","unstructured":"Felgenhauer, B., Jarvis, F.: Enumerating possible Sudoku grids (2005), \n                  \n                    http:\/\/www.afjarvis.staff.shef.ac.uk\/sudoku\/sudoku.pdf"},{"key":"3_CR5","unstructured":"Hanson, B.: Sudoku Assistant\/Solver. Online software written in JavaScript (2007), \n                  \n                    http:\/\/www.stolaf.edu\/people\/hansonr\/sudoku\/"},{"key":"3_CR6","unstructured":"Holst, C.K.: Sudoku\u2014an excercise in constraint programming in Visual Prolog 7. In: 1st Visual Prolog Applications and Language Conference, VIP-ALC 2006, Faro, Portugal (April 2006)"},{"key":"3_CR7","unstructured":"Inkala, A.: AI Escargot\u2014The Most Difficult Sudoku Puzzle, Lulu, Finland (2007) ISBN 978-1-84753-451-4"},{"key":"3_CR8","unstructured":"Juillerat, N.: Sudoku Explainer. Version 1.2 (December 2006), \n                  \n                    http:\/\/diuf.unifr.ch\/people\/juillera\/Sudoku\/Sudoku.html"},{"key":"3_CR9","unstructured":"Knuth, D.E.: Dancing links. In: Davies, J., Roscoe, B., Woodcock, J. (eds.) Millenial Perspectives in Computer Science, pp. 187\u2013214. Palgrave, Houndmills (2000)"},{"key":"3_CR10","unstructured":"Lynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: Berstein, S.Z. (ed.) Proceedings of the 9th International Symposium on Artificial Intelligence and Mathematics, AIMATH 2006, Fort Lauderdale, Florida, USA ( January 2006)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, Las Vegas, USA (June 2001)","DOI":"10.1145\/378239.379017"},{"key":"3_CR12","unstructured":"ravel. The hardest sudokus. Sudoku Players\u2019 Forums (January 25, 2007), \n                  \n                    http:\/\/www.sudoku.com\/forums\/viewtopic.php?t=4212&start=587"},{"key":"3_CR13","unstructured":"Royle, G.: Minimum sudoku (2007), \n                  \n                    http:\/\/people.csse.uwa.edu.au\/gordon\/sudokumin.php"},{"key":"3_CR14","unstructured":"Simonis, H.: Sudoku as a constraint problem. In: Proceedings of the CP Workshop on Modeling and Reformulating Constraint Satisfaction Problems, Sitges, Spain, pp. 13\u201327 (October 2005)"},{"key":"3_CR15","unstructured":"Torres, P., Lopez, P.: Overview and possible extensions of shaving techniques for job-shop problems. In: 2nd International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR 2000, IC-PARC, UK, pp. 181\u2013186 (March 2000)"},{"key":"3_CR16","unstructured":"Weber, T.: A SAT-based Sudoku solver. In: Geoff Sutclife and Andrei Voronkov, editors, 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2005, pp. 11\u201315, Montego Bay, Jamaica (December 2005) (short paper Proceedings)"},{"key":"3_CR17","unstructured":"Yato, T.: Complexity and completeness of finding another solution and its application to puzzles. Master\u2019s thesis, Univ. of Tokyo, Dept. of Information Science, Faculty of Science, Hongo 7-3-1, Bunkyo-ku, Tokyo 113, JAPAN (January 2003), \n                  \n                    http:\/\/www-imai.is.s.u-tokyo.ac.jp\/~yato\/data2\/MasterThesis.ps"}],"container-title":["Studies in Computational Intelligence","Tools and Applications with Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88069-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:55:45Z","timestamp":1619510145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88069-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540880684","9783540880691"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88069-1_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[]}}