{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:36Z","timestamp":1761805296038},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/tciaig.2013.2251884","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T19:43:23Z","timestamp":1362771803000},"page":"251-264","source":"Crossref","is-referenced-by-count":11,"title":["An Efficient Approach to Solving Nonograms"],"prefix":"10.1109","volume":"5","author":[{"given":"I.-Chen","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Der-Johng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lung-Ping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan-Yueh","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ching-Hua","family":"Kuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao-Hua","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Hsuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"51","article-title":"The 2011 TAAI computer-game tournaments","volume":"34","author":"lin","year":"2011","journal-title":"Int Comput Games Assoc J"},{"key":"ref11","first-page":"191","article-title":"An efficient approach to solving the minimum Sudoku problem","volume":"34","author":"lin","year":"2011","journal-title":"Int Comput Games Assoc J"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2012.36"},{"key":"ref13","author":"ol?\ufffdk","year":"0","journal-title":"?Griddlers solver ?"},{"key":"ref14","year":"2012","journal-title":"?Origins of cross reference grid & picture grid puzzles ?"},{"key":"ref15","author":"simpson","year":"0","journal-title":"?Nonogram solver ?"},{"key":"ref16","article-title":"Nonogram tournaments in TAAI 2011","volume":"35","author":"sun","year":"2012","journal-title":"Int Comput Games Assoc J"},{"key":"ref17","author":"ueda","year":"1996","journal-title":"?NP-completeness results for nonogram via parsimonious reductions ?"},{"key":"ref18","first-page":"1","article-title":"A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms","author":"wiggers","year":"2004","journal-title":"Proc 4th Twente Student Conf IT"},{"key":"ref19","year":"0","journal-title":"?Nonogram ?"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/3-540-60299-2_16","volume":"976","author":"bacchus","year":"1995","journal-title":"Principles and Practice of Constraints Programming (CP-95)"},{"key":"ref3","first-page":"1","article-title":"Constructing simple nonograms of varying difficulty","volume":"20","author":"batenburg","year":"2009","journal-title":"Com of Pure and Applied Math"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.001"},{"key":"ref5","first-page":"16","article-title":"Painting by numbers","volume":"65","author":"bosch","year":"2001","journal-title":"OPTIMA"},{"key":"ref8","author":"faase","year":"0","journal-title":"?Nonogram to exact cover ?"},{"key":"ref7","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.12.003"},{"key":"ref9","first-page":"187","author":"knuth","year":"2000","journal-title":"Millenial Perspectives in Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-006-9798-2"},{"key":"ref20","author":"wolter","year":"0","journal-title":"?Effect of line solution caching on Pbnsolve run-times ?"},{"key":"ref22","first-page":"236","article-title":"HAPPYNURI wins Nurikabe tournament","volume":"33","author":"wu","year":"2010","journal-title":"Int Comput Games Assoc J"},{"key":"ref21","author":"wolter","year":"0","journal-title":"?The ?Pbnsolve? paint-by-number puzzle solver ?"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-009-0200-0"},{"key":"ref23","author":"wu","year":"2012","journal-title":"?TAAI2011 Nonogram Tournament result ?"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/6595579\/06476646.pdf?arnumber=6476646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:38Z","timestamp":1642003358000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6476646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":24,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2013.2251884","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}