{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T22:49:14Z","timestamp":1761950954492,"version":"build-2065373602"},"publisher-location":"London","reference-count":16,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781848000933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-1-84800-094-0_4","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T08:25:20Z","timestamp":1196670320000},"page":"37-49","source":"Crossref","is-referenced-by-count":5,"title":["Construction of Heuristics for a Search-Based Approach to Solving Sudoku"],"prefix":"10.1007","author":[{"given":"S. K.","family":"Jones","sequence":"first","affiliation":[]},{"given":"P. A.","family":"Roach","sequence":"additional","affiliation":[]},{"given":"S.","family":"Perkins","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Yato T and Seta T. Complexity and Completeness of Finding another Solution and its Application to Puzzles. In: Proceedings of the National Meeting of the Information Processing Society of Japan, IPSJ, Japan, 2002 (SIG Notes IPSJ-2002-AL-87-2)"},{"key":"4_CR2","unstructured":"Pegg E. Enumerating Sudoku Variations, available at http:\/\/www.maa.org\/editorial\/mathgames\/mathgames_09_05_05.html, 2005"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Dotu I., del Val A and Cebrian M. Redundant modeling for the quasigroup completion problem. In: Rossi, F. (ed.), Principles and Practice of Constraint Programming (CP 2003), Springer-Verlag, Berlin, 2003, pp 288-302 (Volume 2833 of Lecture Notes in Computer Science)","DOI":"10.1007\/978-3-540-45193-8_20"},{"key":"4_CR4","unstructured":"Gomes C and Shmoys D. The Promise of LP to Boost CP Techniques for Combinatorial Problems. In: Jussien N and Laburthe F (eds.), Proceedings of the"},{"key":"4_CR5","unstructured":"Simonis H. Sudoku as a constraint problem. In: Hnich B, Prosser P and Smith B(eds.) Modelling and Reformulating Constraint Satisfaction Problems,Proceedings of the Fourth International Workshop, CP, 2005, pp 13-27"},{"key":"4_CR6","unstructured":"Bartlett AC and Langville AN. An Integer Programming Model for the Sudoku"},{"key":"4_CR7","unstructured":"Gordon R. Minimum Sudoku. Internal Report. University of Western Australia,2006"},{"key":"4_CR8","unstructured":"Rich E and Knight K. Artificial Intelligence (2nd Edition), McGraw-Hill:Singapore, 1991"},{"key":"4_CR9","unstructured":"Jones SK. Solving methods and enumeration of Sudoku. Final Year Project.University of Glamorgan, 2006"},{"key":"4_CR10","unstructured":"Lynce, I and Ouaknine, J. Sudoku as a SAT problem. In: Golumbic M, Hoffman F and Zilberstein S (eds.), Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics , AIMATH, 2006"},{"key":"4_CR11","unstructured":"Kwon G and Jain H. Optimized CNF Encoding for Sudoku Puzzles. In: Hermann M (ed.) Proceedings of the 13th International Conference on Logic Programming for Artificial Intelligence and Reasoning, available at http:\/\/www.lix.polytechnique.fr\/\u223chermann\/LPAR2006\/short\/submission_153.pdf, 2006"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Moraglio A, Togelius J and Lucas S. Product Geometric Crossover for theSudoku puzzle. In: Yen GG, Wang L, Bonissone P and Lucas SM (eds.),Proceedings of the IEEE Congress on Evolutionary Computation, IEEE Press, pages 470-476, 2006","DOI":"10.1109\/CEC.2006.1688347"},{"key":"4_CR13","unstructured":"Cazenave T and Labo IA. A Search Based Sudoku solver, available at http:\/\/www.ai.univ-paris8.fr\/\u223ccazenave\/sudoku.pdf, 2006 Research and Development in Intelligent Systems XXIV 49"},{"key":"4_CR14","unstructured":"Felgenhauer B and Jarvis F. Enumerating Possible Sudoku Grids. Internal Report. University of Sheffield, 2005"},{"key":"4_CR15","unstructured":"Inkala A. AI Escargot - The Most Difficult Sudoku Puzzle, Lulu Publishing,2007"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Michalewicz Z and Fogel DB. How to Solve It: Modern Heuristics, Springer:Berlin, 2000","DOI":"10.1007\/978-3-662-04131-4"}],"container-title":["Research and Development in Intelligent Systems XXIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84800-094-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:05:24Z","timestamp":1737608724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84800-094-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781848000933"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-84800-094-0_4","relation":{},"subject":[]}}