{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:03:35Z","timestamp":1743051815313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030658823"},{"type":"electronic","value":"9783030658830"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-65883-0_10","type":"book-chapter","created":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T18:02:42Z","timestamp":1608400962000},"page":"119-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Efficiency of Fully Probing Mechanisms in Nonogram Solving Algorithm"],"prefix":"10.1007","author":[{"given":"Yan-Rong","family":"Guo","sequence":"first","affiliation":[]},{"given":"Wei-Chiao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jia-Jun","family":"Yeh","sequence":"additional","affiliation":[]},{"given":"Hsi-Ya","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Lung-Pin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Kuo-Chan","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,20]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10851-006-9798-2","volume":"27","author":"KJ Batenburg","year":"2007","unstructured":"Batenburg, K.J.: A network flow algorithm for reconstructing binary images from dis- crete X-rays. J. Math. Imag. Vis. 27(2), 175\u2013191 (2007)","journal-title":"J. Math. Imag. Vis."},{"key":"10_CR2","first-page":"1","volume":"20","author":"KJ Batenburg","year":"2009","unstructured":"Batenburg, K.J., Henstra, S., Kosters, W.A., Palenstijn, W.J.: Constructing simple nonograms of varying difficulty. Pure Math. Appl. 20, 1\u201315 (2009)","journal-title":"Pure Math. Appl."},{"issue":"8","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.patcog.2008.12.003","volume":"42","author":"KJ Batenburg","year":"2009","unstructured":"Batenburg, K.J., Kosters, W.A.: Solving nonograms by combining relaxations. Pattern Recogn. 42(8), 1672\u20131683 (2009)","journal-title":"Pattern Recogn."},{"key":"10_CR4","first-page":"16","volume":"65","author":"RA Bosch","year":"2001","unstructured":"Bosch, R.A.: Painting by numbers. Optima 65, 16\u201317 (2001)","journal-title":"Optima"},{"issue":"4","key":"10_CR5","first-page":"387","volume":"40","author":"LP Chen","year":"2018","unstructured":"Chen, L.P., Huang, K.C.: Solving nonogram puzzles by using group-based fully probing. Comput. Games Assoc. J. 40(4), 387\u2013396 (2018)","journal-title":"Comput. Games Assoc. J."},{"key":"10_CR6","unstructured":"Chen, L.P., Hung, C.Y., Liu, Y.C.: A new simplified line solver for nonogram puzzle games. In: TCGA Computer Game Workshop (TCGA2017) (2017)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y.C., Lin, S.S.: A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments. Comput. Games Assoc. J. 1\u201313 (2019, pre-press)","DOI":"10.3233\/ICG-190097"},{"key":"10_CR8","unstructured":"Faase, F.: Nonogram to exact cover, 31 March 2018 (2009). http:\/\/www.iwriteiam.nl\/D0906.html#28"},{"issue":"4","key":"10_CR9","first-page":"397","volume":"40","author":"KC Huang","year":"2018","unstructured":"Huang, K.C., Yeh, J.J., Huang, W.C., Guo, Y.R.: Exploring effects of fully probing sequence on solving nonogram puzzles. Comput. Games Assoc. J. 40(4), 397\u2013405 (2018)","journal-title":"Comput. Games Assoc. J."},{"key":"10_CR10","unstructured":"Jing, M.Q.: Solving Japanese puzzles with logical rules and depth first search algorithm. In: International Conference on Machine Learning and Cybernetics, pp. 2962\u20132967 (2009)"},{"key":"10_CR11","unstructured":"Knuth, D.E.: Dancing links. In: Millennial Perspectives in Computer Science: the Oxford-Microsoft Symposium in Honour of Sir Tony Hoare (Cornerstones of Computing), Basingstoke, U.K., pp. 187\u2013214. Palgrave (1999)"},{"issue":"1","key":"10_CR12","first-page":"51","volume":"34","author":"HH Lin","year":"2011","unstructured":"Lin, H.H., Sun, D.J., Wu, I.C., Yen, S.J.: The 2011 TAAI computer-game tournaments. Comput. Games Assoc. J. 34(1), 51\u201354 (2011)","journal-title":"Comput. Games Assoc. J."},{"key":"10_CR13","unstructured":"LalaFrogKK, 11 May 2019 (2015). http:\/\/java.csie.nctu.edu.tw\/~icwu\/aigames\/LalaFrogKK.html"},{"key":"10_CR14","unstructured":"Nonogram: Wikipedia, the free encyclopedia, 11 May 2019 (2017). http:\/\/en.wikipedia.org\/wiki\/Nonogram"},{"key":"10_CR15","unstructured":"Ol\u0161\u00e1k, M., Ol\u0161\u00e1k, P.: Griddlers solver, 11 May 2019 (2003). http:\/\/www.olsak.net\/grid.html#English"},{"key":"10_CR16","unstructured":"Simpson, S.: Nonogram solver, 11 May 2019. http:\/\/www.lancaster.ac.uk\/~simpsons\/software\/pkg-nonowimp.htmlz.en-GB"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10489-011-0335-7","volume":"37","author":"J Tsai","year":"2012","unstructured":"Tsai, J.: Solving Japanese nonograms by taguchi-based genetic algorithm. Appl. Intell. 37(3), 405\u2013419 (2012)","journal-title":"Appl. Intell."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Tsai, J., Chou, P.: Solving Japanese puzzles by genetic algorithms. In: International Conference on Machine Learning and Cybernetics, pp. 785\u2013788 (2011)","DOI":"10.1109\/ICMLC.2011.6016787"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TE.2011.2158214","volume":"55","author":"J Tsai","year":"2012","unstructured":"Tsai, J., Chou, P., Fang, J.: Learning intelligent genetic algorithms using Japanese nonograms. IEEE Trans. Educ. 55(2), 164\u2013168 (2012)","journal-title":"IEEE Trans. Educ."},{"key":"10_CR20","unstructured":"Ueda, N., Nagao, T.: NP-completeness results for nonogram via parsimonious reductions. Tech. rep. TR96-0008, Department Computer Science, Tokyo Institute Technology, Tokyo, Japan (1996)"},{"key":"10_CR21","unstructured":"Wiggers, W.A.: A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms. In: Twenty Student Conference IT, pp. 1\u20136 (2004)"},{"key":"10_CR22","unstructured":"Wolter, J.: The \u2018Pbnsolve\u2019 paint-by-number puzzle solver, 11 May 2019 (2012). http:\/\/webpbn.com\/pbnsolve.html"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCIAIG.2013.2251884","volume":"5","author":"IC Wu","year":"2013","unstructured":"Wu, I.C., et al.: An efficient approach to solving nonograms. IEEE Trans. Comput. Intell. AI Game 5(3), 251\u2013264 (2013)","journal-title":"IEEE Trans. Comput. Intell. AI Game"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s10489-009-0200-0","volume":"35","author":"CH Yu","year":"2009","unstructured":"Yu, C.H., Lee, H.L., Chen, L.H.: An efficient algorithm for solving nonograms. Appl. Intell. 35(1), 18\u201331 (2009)","journal-title":"Appl. Intell."}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65883-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T18:04:05Z","timestamp":1608401045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65883-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030658823","9783030658830"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65883-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Advances in Computer Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acg2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=2679","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,89","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}