{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:13Z","timestamp":1742911753165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031149252"},{"type":"electronic","value":"9783031149269"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14926-9_32","type":"book-chapter","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T03:25:15Z","timestamp":1660274715000},"page":"356-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Irregular Learning Cellular Automata for\u00a0the\u00a0Resolution of\u00a0Complex Logic Puzzles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2587-1895","authenticated-orcid":false,"given":"Theodoros Panagiotis","family":"Chatzinikolaou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1856-1813","authenticated-orcid":false,"given":"Rafailia-Eleni","family":"Karamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8240-484X","authenticated-orcid":false,"given":"Georgios Ch.","family":"Sirakoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,13]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2016.12.006","volume":"53","author":"M Ahangaran","year":"2017","unstructured":"Ahangaran, M., Taghizadeh, N., Beigy, H.: Associative cellular learning automata and its applications. Appl. Soft Comput. 53, 1\u201318 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"3\u20134","key":"32_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1142\/S0219525904000202","volume":"7","author":"H Beigy","year":"2004","unstructured":"Beigy, H., Meybodi, M.R.: A mathematical framework for cellular learning automata. Adv. Compl. Syst. 7(3\u20134), 295\u2013319 (2004)","journal-title":"Adv. Compl. Syst."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Chatzinikolaou, T.P., et al.: Memristive oscillatory circuits for resolution of np-complete logic puzzles: sudoku case. In: 2020 ISCAS, pp. 1\u20135 (2020)","DOI":"10.1109\/ISCAS45731.2020.9181110"},{"issue":"3","key":"32_CR4","first-page":"141","volume":"15","author":"T Floros","year":"2020","unstructured":"Floros, T., Tsakalos, K.A., Dourvas, N., Tsompanas, M.A., Sirakoulis, G.C.: Unconventional bio-inspired model for design of logic gates. Int. J. Unconvent. Comput. 15(3), 141\u2013156 (2020)","journal-title":"Int. J. Unconvent. Comput."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Hufkens, L.V., Browne, C.: A functional taxonomy of logic puzzles. In: 2019 IEEE Conference on Games (CoG), pp. 1\u20134. IEEE (2019)","DOI":"10.1109\/CIG.2019.8848107"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Ioannidis, K., Sirakoulis, G.C., Andreadis, I.: A cellular automaton collision-free path planner suitable for cooperative robots. In: 2008 Panhellenic Conference on Informatics, pp. 256\u2013260 (2008)","DOI":"10.1109\/PCI.2008.43"},{"key":"32_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2021.110700","volume":"145","author":"RE Karamani","year":"2021","unstructured":"Karamani, R.E., Fyrigos, I.A., Tsakalos, K.A., Ntinas, V., Tsompanas, M.A., Sirakoulis, G.C.: Memristive learning cellular automata for edge detection. Chaos Solitons Fractals 145, 110700 (2021)","journal-title":"Chaos Solitons Fractals"},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10732-007-9012-8","volume":"13","author":"R Lewis","year":"2007","unstructured":"Lewis, R.: Metaheuristics can solve sudoku puzzles. J. Heurist. 13(4), 387\u2013401 (2007)","journal-title":"J. Heurist."},{"issue":"1","key":"32_CR9","first-page":"6","volume":"11","author":"I Lynce","year":"2006","unstructured":"Lynce, I., Ouaknine, J.: Sudoku as a sat problem. ISAIM 11(1), 6\u201313 (2006)","journal-title":"ISAIM"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Mantere, T., Koljonen, J.: Solving, rating and generating sudoku puzzles with GA. In: 2007 IEEE Congress on Evolutionary Computation, pp. 1382\u20131389 (2007)","DOI":"10.1109\/CEC.2007.4424632"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jocs.2018.09.003","volume":"32","author":"M Mitsopoulou","year":"2019","unstructured":"Mitsopoulou, M., Dourvas, N.I., Sirakoulis, G.C., Nishinari, K.: Spatial games and memory effects on crowd evacuation behavior with cellular automata. J. Comput. Sci. 32, 87\u201398 (2019)","journal-title":"J. Comput. Sci."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jocs.2015.08.002","volume":"11","author":"M Mozafari","year":"2015","unstructured":"Mozafari, M., Shiri, M.E., Beigy, H.: A cooperative learning method based on cellular learning automata and its application in optimization problems. J. Comput. Sci. 11, 279\u2013288 (2015)","journal-title":"J. Comput. Sci."},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TSMC.1974.5408453","volume":"4","author":"KS Narendra","year":"1974","unstructured":"Narendra, K.S., Thathachar, M.A.L.: Learning automata - a survey. IEEE Trans. Syst. Man Cybern. SMC 4(4), 323\u2013334 (1974)","journal-title":"IEEE Trans. Syst. Man Cybern. SMC"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Pacurib, J.A., Seno, G.M.M., Yusiong, J.P.T.: Solving sudoku puzzles using improved artificial bee colony algorithm. In: ICICIC 2009, pp. 885\u2013888. IEEE (2009)","DOI":"10.1109\/ICICIC.2009.334"},{"issue":"2","key":"32_CR15","first-page":"54","volume":"39","author":"E Russell","year":"2006","unstructured":"Russell, E., Jarvis, F.: Mathematics of Sudoku II. Math. Spect. 39(2), 54\u201358 (2006)","journal-title":"Math. Spect."},{"key":"32_CR16","unstructured":"Simonis, H.: Sudoku as a constraint problem. In: CP Workshop on Modeling and Reformulating Constraint Satisfaction Problems, vol. 12, pp. 13\u201327. Citeseer (2005)"},{"issue":"8","key":"32_CR17","doi-asserted-by":"publisher","first-page":"9237","DOI":"10.1016\/j.eswa.2011.01.098","volume":"38","author":"JA Torkestani","year":"2011","unstructured":"Torkestani, J.A., Meybodi, M.R.: A cellular learning automata-based algorithm for solving the vertex coloring problem. Exp. Syst. Appl. 38(8), 9237\u20139247 (2011)","journal-title":"Exp. Syst. Appl."},{"key":"32_CR18","doi-asserted-by":"publisher","unstructured":"Tsompanas, M.-A.I., Dourvas, N.I., Ioannidis, K., Sirakoulis, G.Ch., Hoffmann, R., Adamatzky, A.: Cellular automata applications in shortest path problem. In: Adamatzky, A. (ed.) Shortest Path Solvers. From Software to Wetware. ECC, vol. 32, pp. 199\u2013237. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77510-4_8","DOI":"10.1007\/978-3-319-77510-4_8"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Vamsi, K.S., Gangadharabhotla, S., Sai, V.S.H.: A deep learning approach to solve sudoku puzzle. In: 2021 ICICCS, pp. 1175\u20131179. IEEE (2021)","DOI":"10.1109\/ICICCS51141.2021.9432326"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Van Der Bok, K., Taouil, M., Afratis, P., Sourdis, I.: The TU Delft sudoku solver on FPGA. In: 2009 International Conference on Field-Programmable Technology, pp. 526\u2013529. IEEE (2009)","DOI":"10.1109\/FPT.2009.5377605"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14926-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T23:08:21Z","timestamp":1662332901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14926-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031149252","9783031149269"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14926-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACRI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cellular Automata for Research and Industry","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Geneva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acri2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acri2022.unige.ch\/","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":"36","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":"31","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":"86% - 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.03","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":"2.18","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}