{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T23:06:52Z","timestamp":1747868812838,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"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":[[2022,9]]},"DOI":"10.1109\/tg.2021.3081817","type":"journal-article","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T21:28:43Z","timestamp":1621459723000},"page":"391-402","source":"Crossref","is-referenced-by-count":5,"title":["J-POP: Japanese Puzzles as Optimization Problems"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6537-4036","authenticated-orcid":false,"given":"Huw","family":"Lloyd","sequence":"first","affiliation":[{"name":"Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4547-3701","authenticated-orcid":false,"given":"Matthew","family":"Crossley","sequence":"additional","affiliation":[{"name":"Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0500-3705","authenticated-orcid":false,"given":"Mark","family":"Sinclair","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Northumbria University, Newcastle upon Tyne, U.K."}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1680-5535","authenticated-orcid":false,"given":"Martyn","family":"Amos","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Northumbria University, Newcastle upon Tyne, U.K."}]}],"member":"263","reference":[{"volume-title":"Puzzle Ninja","year":"2017","author":"Bellos","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63519-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1147\/rd.33.0210"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/14786445008521796"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2014.2339221"},{"volume-title":"The Puzzle Instinct: The Meaning of Puzzles in Human Life","year":"2004","author":"Danesi","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633649"},{"volume-title":"Taking Sudoku Seriously: The Math Behind the Worlds Most Popular Pencil Puzzle","year":"2011","author":"Rosenhouse","key":"ref9"},{"issue":"5","key":"ref10","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."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2008-31103"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13122-6_31"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2011-534"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.07.017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208251"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2019.2942773"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0606-80"},{"key":"ref18","first-page":"11","article-title":"A SAT-based Sudoku solver","volume-title":"Proc. 12th Int. Conf. Logic Program., Artif. Intell., Reasoning: Short Paper","author":"Weber","year":"2005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIT.2008.154"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9012-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7743888"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2008.4668293"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1276975"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13498-2_60"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.05.019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2169253"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.29"},{"article-title":"Dancing links","year":"2000","author":"Knuth","key":"ref29"},{"author":"Norvig","key":"ref30","article-title":"Solving every sudoku puzzle"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07890-8_19"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.21.26"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.23.276"},{"article-title":"Benchmark instances and branch-and-cut algorithm for the Hashiwokakero puzzle","year":"2019","author":"Coelho","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3319619.3338470"},{"key":"ref36","first-page":"77","article-title":"On the NP-completeness of the Nurikabe pencil puzzle and variants thereof","volume-title":"Proc. 3rd Int. Conf. FUN Algorithms","author":"Holzer","year":"2004"},{"article-title":"The complexity of puzzles: NP-completeness results for Nurikabe and Minesweeper","year":"2003","author":"McPhail","key":"ref37"},{"article-title":"Solving challenging grid puzzles with answer set programming","year":"2007","author":"Cayl1","key":"ref38"},{"volume-title":"Proc. 16th Int. RCRA Workshop","year":"2009","author":"Celik","key":"ref39"},{"author":"Tamura","key":"ref40","article-title":"Nurikabe solver in copris"},{"key":"ref41","first-page":"25","article-title":"On the NP-completeness of the slither link puzzle","volume":"74","author":"Yato","year":"2000","journal-title":"IPSJ SIGNotes ALgorithms"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2012.36"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3390\/a5020176"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.44.6399"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.61"},{"author":"Beasley","key":"ref46","article-title":"OR Library"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"author":"Janko","key":"ref48","article-title":"Raetsel, puzzles und anderer denksport"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/9891715\/09436021.pdf?arnumber=9436021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:16:30Z","timestamp":1704845790000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9436021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tg.2021.3081817","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"type":"print","value":"2475-1502"},{"type":"electronic","value":"2475-1510"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}