{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T12:40:02Z","timestamp":1748522402678,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213798"},{"type":"electronic","value":"9783319213804"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21380-4_102","type":"book-chapter","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T02:15:38Z","timestamp":1437358538000},"page":"598-603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Filtering Technique for Helping to Solve Sudoku Problems"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Soto","sequence":"first","affiliation":[]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Cristian","family":"Galleguillos","sequence":"additional","affiliation":[]},{"given":"Kathleen","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"102_CR1","doi-asserted-by":"crossref","unstructured":"Asif, M.: Solving NP-complete problem using ACO algorithm. In: International Conference on Emerging Technologies, pp. 13\u201316. IEEE Computer Society (2009)","DOI":"10.1109\/ICET.2009.5353209"},{"issue":"4","key":"102_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10732-007-9012-8","volume":"13","author":"R Lewis","year":"2007","unstructured":"Lewis, R.: Metaheuristics can solve sudoku puzzles. J. Heuristics 13(4), 387\u2013401 (2007)","journal-title":"J. Heuristics"},{"key":"102_CR3","unstructured":"Lynce, I., Ouaknine, J.: Sudoku as a sat problem. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM) (2006)"},{"issue":"1","key":"102_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"102_CR5","doi-asserted-by":"crossref","unstructured":"Mantere, T., Koljonen, J.: Solving, rating and generating sudoku puzzles with ga. In: IEEE Congress on Evolutionary Computation, pp. 1382\u20131389. IEEE (2007)","DOI":"10.1109\/CEC.2007.4424632"},{"key":"102_CR6","doi-asserted-by":"crossref","unstructured":"Mantere, T., Koljonen, J.: Solving and analyzing sudokus with cultural algorithms. In: 2008 IEEE Congress on Evolutionary Computation. CEC 2008. (IEEE World Congress on Computational Intelligence), pp. 4053\u20134060, June 2008","DOI":"10.1109\/CEC.2008.4631350"},{"key":"102_CR7","unstructured":"McGuire, G., Tugemann, B., Civario, G.: There is no 16-clue sudoku: Solving the sudoku minimum number of clues problem. CoRR, abs\/1201.0749 (2012)"},{"key":"102_CR8","doi-asserted-by":"crossref","unstructured":"Moraglio, A., Togelius, J.: Geometric particle swarm optimization for the sudoku puzzle. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 118\u2013125. ACM, New York, NY, USA (2007)","DOI":"10.1145\/1276958.1276975"},{"key":"102_CR9","doi-asserted-by":"crossref","unstructured":"Moraglio, A., Togelius, J., Lucas, S.: Product geometric crossover for the sudoku puzzle. In: IEEE Congress on Evolutionary Computation, pp. 470\u2013476. IEEE Computer Society (2006)","DOI":"10.1109\/CEC.2006.1688347"},{"key":"102_CR10","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, New York (2006)"},{"key":"102_CR11","unstructured":"Simonis, H.: Sudoku as a Constraint Problem. In: Hnich, B., Prosser, P., Smith, B. (eds.) Proceedings 4th International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 13\u201327 (2005)"},{"issue":"15","key":"102_CR12","doi-asserted-by":"publisher","first-page":"5817","DOI":"10.1016\/j.eswa.2013.05.019","volume":"40","author":"R Soto","year":"2013","unstructured":"Soto, R., Crawford, B., Galleguillos, C., Monfroy, E., Paredes, F.: A hybrid ac3-tabu search algorithm for solving sudoku puzzles. Expert Syst. Appl. 40(15), 5817\u20135821 (2013)","journal-title":"Expert Syst. Appl."},{"key":"102_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1155\/2014\/465359","volume":"2014","author":"R Soto","year":"2014","unstructured":"Soto, R., Crawford, B., Galleguillos, C., Monfroy, E., Paredes, F.: A prefiltered cuckoo search algorithm with geometric operators for solving sudoku problems. Sci. World J. 2014, 12 (2014). cited By (since 1996)2","journal-title":"Sci. World J."},{"issue":"5","key":"102_CR14","first-page":"1052","volume":"E86\u2013A","author":"T Yato","year":"2003","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. E86\u2013A(5), 1052\u20131060 (2003)","journal-title":"IEICE Trans."}],"container-title":["Communications in Computer and Information Science","HCI International 2015 - Posters\u2019 Extended Abstracts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21380-4_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T12:14:40Z","timestamp":1748520880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21380-4_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213798","9783319213804"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21380-4_102","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}