{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:40:32Z","timestamp":1743561632226,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865848","type":"print"},{"value":"9783031865855","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-86585-5_11","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:26:11Z","timestamp":1743560771000},"page":"130-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Nonograms: A Constraint Satisfaction Approach"],"prefix":"10.1007","author":[{"given":"Abik","family":"Aramian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4175-7829","authenticated-orcid":false,"given":"Varduhi","family":"Yeghiazaryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"11_CR1","unstructured":"ArrayBlockingQueue: JDK 21 api specification. https:\/\/docs.oracle.com\/en\/java\/javase\/21\/docs\/api\/java.base\/java\/util\/concurrent\/ArrayBlockingQueue.html. Accessed Sept 11 2024"},{"key":"11_CR2","unstructured":"Hanjie dataset. https:\/\/github.com\/susarip\/test\/blob\/master\/hanjie_scraper\/hanjie_scraper\/hanjie.csv. Accessed 20 Apr 2024"},{"key":"11_CR3","unstructured":"Batenburg, K.J., Henstra, S., Kosters, W.A., Palenstijn, W.J.: Constructing simple nonograms of varying difficulty. Pure Math. Appl. (Pu. MA) 20, 1\u201315 (2009)"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.dam.2014.01.004","volume":"169","author":"D Berend","year":"2014","unstructured":"Berend, D., Pomeranz, D., Rabani, R., Raziel, B.: Nonograms: combinatorial questions and algorithms. Discret. Appl. Math. 169, 30\u201342 (2014)","journal-title":"Discret. Appl. Math."},{"key":"11_CR5","unstructured":"Deitel, P., Deitel, H.: Java: How to Program. Pearson Education, tenth edn. (2015)"},{"key":"11_CR6","unstructured":"Halim, S., Halim, F.: Competitive programming 3: The New Lower Bound of Programming Contests. Lulu, third edn. (2013)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TG.2020.3036687","volume":"14","author":"KA Khan","year":"2020","unstructured":"Khan, K.A.: Solving nonograms using integer programming without coloring. IEEE Trans. Games 14(1), 56\u201363 (2020)","journal-title":"IEEE Trans. Games"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"100652","DOI":"10.1016\/j.entcom.2024.100652","volume":"50","author":"JM Buades Rubio","year":"2024","unstructured":"Buades Rubio, J.M., Jaume-i-Cap\u00f3, A., L\u00f3pez Gonz\u00e1lez, D., Moy\u00e0 Alcover, G.: Solving nonograms using neural networks. Entertain. Comput. 50, 100652 (2024). https:\/\/doi.org\/10.1016\/j.entcom.2024.100652","journal-title":"Entertain. Comput."},{"key":"11_CR9","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson, fourth edn. (2020)"},{"key":"11_CR10","unstructured":"Tran, T.H.: Modeling and Solving the Nonogram Puzzle Using Constraint Programming. Undergraduate thesis, Department of Computer Science and Engineering, University of Nebraska-Lincoln (2019)"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1016\/j.procs.2021.08.194","volume":"192","author":"J Wi\u0119ckowski","year":"2021","unstructured":"Wi\u0119ckowski, J., Shekhovtsov, A.: Algorithms effectiveness comparison in solving nonogram boards. Proc. Comput. Sci. 192, 1885\u20131893 (2021)","journal-title":"Proc. Comput. Sci."},{"key":"11_CR12","unstructured":"Wolter, J.: Survey of paint-by-number puzzle solvers. https:\/\/webpbn.com\/survey\/. Accessed Aug 5 2024"},{"issue":"3","key":"11_CR13","doi-asserted-by":"crossref","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 Games 5(3), 251\u2013264 (2013)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/s10489-009-0200-0","volume":"35","author":"CH Yu","year":"2011","unstructured":"Yu, C.H., Lee, H.L., Chen, L.H.: An efficient algorithm for solving nonograms. Appl. Intell. 35, 18\u201331 (2011)","journal-title":"Appl. Intell."},{"key":"11_CR15","unstructured":"Zavistanavi\u010dius, R.: Nonogram solving algorithms analysis and implementation for augmented reality system. Master\u2019s thesis, Kaunas University of Technology (2013)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86585-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:26:31Z","timestamp":1743560791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86585-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865848","9783031865855"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86585-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CG 2024","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computers and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=3907","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}