{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:35:03Z","timestamp":1776890103630,"version":"3.51.2"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Games"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/tg.2019.2942773","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T20:07:15Z","timestamp":1569010035000},"page":"302-311","source":"Crossref","is-referenced-by-count":26,"title":["Solving <i>Sudoku<\/i> With Ant Colony Optimization"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6537-4036","authenticated-orcid":false,"given":"Huw","family":"Lloyd","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1680-5535","authenticated-orcid":false,"given":"Martyn","family":"Amos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.29"},{"key":"ref32","author":"inkala","year":"2007","journal-title":"AI Escargot - The Most Difficult Sudoku Puzzle"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.4108\/icst.iniscom.2015.258984"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14313\/JAMRIS_2-2015\/14"},{"key":"ref37","article-title":"On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs?","author":"birattari","year":"2004"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/srep00725"},{"key":"ref35","article-title":"dlx-cpp","author":"laire","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref10","first-page":"327","article-title":"Taking the mystery out of Sudoku difficulty: An Oracular model","volume":"29","author":"fletcher","year":"2007","journal-title":"UMAP Journal"},{"key":"ref11","first-page":"11","article-title":"A SAT-based Sudoku solver","author":"weber","year":"0","journal-title":"Proc 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning Short Paper Proceedings"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICICIC.2009.334"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIT.2008.154"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9012-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-011-0413-0"},{"key":"ref16","first-page":"1382","author":"mantere","year":"0","journal-title":"Proc IEEE Congr Evol Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7743888"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257096"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2008.4668293"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_10"},{"key":"ref4","first-page":"1052","article-title":"Complexity and completeness of finding another solution and its application to puzzles","volume":"86","author":"yato","year":"2003","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07153-4_21-1"},{"key":"ref3","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63519-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/WICT.2013.7113148"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90075-1"},{"key":"ref8","article-title":"Dancing links","author":"knuth","year":"2000","journal-title":"Preprint"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref2","article-title":"Solving every Sudoku puzzle","author":"norvig","year":"2018"},{"key":"ref9","first-page":"343","article-title":"Difficulty-driven Sudoku puzzle generation","volume":"29","author":"hunt","year":"2007","journal-title":"UMAP Journal"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0606-80"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1276975"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.05.019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13498-2_60"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2169253"},{"key":"ref26","first-page":"36","article-title":"Ant colony optimization","author":"dorigo","year":"2011","journal-title":"Encyclopedia of Machine Learning"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/9197750\/08845599.pdf?arnumber=8845599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T12:56:59Z","timestamp":1651064219000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8845599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":37,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tg.2019.2942773","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"value":"2475-1502","type":"print"},{"value":"2475-1510","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}