{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:02:05Z","timestamp":1760598125199,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["318930, 335729"],"award-info":[{"award-number":["318930, 335729"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,13]]},"DOI":"10.1145\/3477911.3477915","type":"proceedings-article","created":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T00:14:14Z","timestamp":1634343254000},"page":"18-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["On Using Monte-Carlo Tree Search to Solve Puzzles"],"prefix":"10.1145","author":[{"given":"Mohammad Sina","family":"Kiarostami","sequence":"first","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadreza","family":"Daneshvaramoli","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences(IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saleh","family":"Khalaj Monfared","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences(IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aku","family":"Visuri","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helia","family":"Karisani","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences(IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simo","family":"Hosio","sequence":"additional","affiliation":[{"name":"University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Khashehchi","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences (IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehsan","family":"Futuhi","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences (IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dara","family":"Rahmati","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences (IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeid","family":"Gorgin","sequence":"additional","affiliation":[{"name":"Institute for Research in Fundamental Sciences (IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,10,15]]},"reference":[{"unstructured":"Ahmed Abdelkader Aditya Acharya and Philip Dasler. 2015. 2048 is NP-Complete. Ahmed Abdelkader Aditya Acharya and Philip Dasler. 2015. 2048 is NP-Complete.","key":"e_1_3_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.5555\/1875616.1875646"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/3007337.3007361"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/TCIAIG.2014.2366555"},{"key":"e_1_3_2_1_5_1","volume-title":"The complexity of Clickomania. More games of no chance 42","author":"Biedl C","year":"2002","unstructured":"Therese\u00a0 C Biedl , Erik\u00a0 D Demaine , Martin\u00a0 L Demaine , Rudolf Fleischer , Lars Jacobsen , and J\u00a0Ian Munro . 2002. The complexity of Clickomania. More games of no chance 42 ( 2002 ), 389\u2013404. Therese\u00a0C Biedl, Erik\u00a0D Demaine, Martin\u00a0L Demaine, Rudolf Fleischer, Lars Jacobsen, and J\u00a0Ian Munro. 2002. The complexity of Clickomania. More games of no chance 42 (2002), 389\u2013404."},{"unstructured":"Fr\u00e9d\u00e9ric Boussemart Christophe Lecoutre Gilles Audemard and C\u00e9dric Piette. 2016. XCSP3: An integrated format for benchmarking combinatorial constrained problems. arXiv preprint arXiv:1611.03398(2016). Fr\u00e9d\u00e9ric Boussemart Christophe Lecoutre Gilles Audemard and C\u00e9dric Piette. 2016. XCSP3: An integrated format for benchmarking combinatorial constrained problems. arXiv preprint arXiv:1611.03398(2016).","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","first-page":"23","article-title":"The nature of puzzles","volume":"1","author":"Browne Cameron","year":"2015","unstructured":"Cameron Browne . 2015 . The nature of puzzles . Game & Puzzle Design 1 , 1 (2015), 23 \u2013 34 . Cameron Browne. 2015. The nature of puzzles. Game & Puzzle Design 1, 1 (2015), 23\u201334.","journal-title":"Game & Puzzle Design"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/TCIAIG.2012.2186810"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/1661445.1661518"},{"unstructured":"Mehmet Celik Halit Erdogan Firat Tahaoglu Tansel Uras and Esra Erdem. 2009. Comparing ASP and CP on Four Grid Puzzles.. In RCRA@ AI* IA. Mehmet Celik Halit Erdogan Firat Tahaoglu Tansel Uras and Esra Erdem. 2009. Comparing ASP and CP on Four Grid Puzzles.. In RCRA@ AI* IA.","key":"e_1_3_2_1_10_1"},{"unstructured":"Diogo\u00a0M Costa. 2018. Computational Complexity of Games and Puzzles. arXiv preprint arXiv:1807.04724(2018). Diogo\u00a0M Costa. 2018. Computational Complexity of Games and Puzzles. arXiv preprint arXiv:1807.04724(2018).","key":"e_1_3_2_1_11_1"},{"unstructured":"Broderick Crawford Carlos Castro Eric Monfroy and Nibaldo Rodr\u0131guez. 2009. Solving constraint satisfaction puzzles with constraint programming. In Congreso de Int Computacional Aplicada CIC. Broderick Crawford Carlos Castro Eric Monfroy and Nibaldo Rodr\u0131guez. 2009. Solving constraint satisfaction puzzles with constraint programming. In Congreso de Int Computacional Aplicada CIC.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","volume-title":"Decentralized Communication-less Multi-Agent Task Assignment with Cooperative Monte-Carlo Tree Search. In 2020 6th International Conference on Control, Automation and Robotics (ICCAR). IEEE, 612\u2013616","author":"Daneshvaramoli Mohammadreza","year":"2020","unstructured":"Mohammadreza Daneshvaramoli , Mohammad\u00a0Sina Kiarostami , Saleh\u00a0Khalaj Monfared , Helia Karisani , Keivan Dehghannayeri , Dara Rahmati , and Saeid Gorgin . 2020 . Decentralized Communication-less Multi-Agent Task Assignment with Cooperative Monte-Carlo Tree Search. In 2020 6th International Conference on Control, Automation and Robotics (ICCAR). IEEE, 612\u2013616 . Mohammadreza Daneshvaramoli, Mohammad\u00a0Sina Kiarostami, Saleh\u00a0Khalaj Monfared, Helia Karisani, Keivan Dehghannayeri, Dara Rahmati, and Saeid Gorgin. 2020. Decentralized Communication-less Multi-Agent Task Assignment with Cooperative Monte-Carlo Tree Search. In 2020 6th International Conference on Control, Automation and Robotics (ICCAR). IEEE, 612\u2013616."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1016\/j.neunet.2019.06.005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/3104322.3104369"},{"key":"e_1_3_2_1_16_1","volume-title":"A rule-based appr to the puzzle of Slitherlink. Univ","author":"Herting Stefan","year":"2004","unstructured":"Stefan Herting . 2004. A rule-based appr to the puzzle of Slitherlink. Univ . Kent, UK , Tech. Rep( 2004 ). Stefan Herting. 2004. A rule-based appr to the puzzle of Slitherlink. Univ. Kent, UK, Tech. Rep(2004)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.3233\/ICG-2008-31103"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/CIG.2019.8848043"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.5555\/3171642.3171683"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1609\/aaai.v33i01.33011699"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1978542.1978548","article-title":"A new benchmark for AI.Commun","volume":"54","author":"Kroeker L","year":"2011","unstructured":"Kirk\u00a0 L Kroeker . 2011 . A new benchmark for AI.Commun . ACM 54 , 8 (2011), 13 \u2013 15 . Kirk\u00a0L Kroeker. 2011. A new benchmark for AI.Commun. ACM 54, 8 (2011), 13\u201315.","journal-title":"ACM"},{"unstructured":"Nathaniel Love Timothy Hinrichs David Haley Eric Schkufza and Michael Genesereth. 2008. General game playing: Game description language specification. (2008). Nathaniel Love Timothy Hinrichs David Haley Eric Schkufza and Michael Genesereth. 2008. General game playing: Game description language specification. (2008).","key":"e_1_3_2_1_22_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/IAdCC.2014.6779291"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/978-3-319-09284-3_16"},{"volume-title":"IFIP congress, Vol.\u00a0256.","author":"Newell Allen","unstructured":"Allen Newell , John\u00a0 C Shaw , and Herbert\u00a0 A Simon . 1959. Report on a general problem solving program . In IFIP congress, Vol.\u00a0256. Pittsburgh, PA , 64. Allen Newell, John\u00a0C Shaw, and Herbert\u00a0A Simon. 1959. Report on a general problem solving program. In IFIP congress, Vol.\u00a0256. Pittsburgh, PA, 64.","key":"e_1_3_2_1_25_1"},{"key":"e_1_3_2_1_26_1","volume-title":"PROCEEDINGS OF THE NATIONAL CONF ON AI, Vol.\u00a022.","author":"O\u2019Sullivan Barry","year":"1999","unstructured":"Barry O\u2019Sullivan and John Horan . 2007. Generating and solving logic puzzles through constraint satisfaction . In PROCEEDINGS OF THE NATIONAL CONF ON AI, Vol.\u00a022. Menlo Park , CA; Cambridge, MA; London; AAAI Press; MIT Press ; 1999 , 1974. Barry O\u2019Sullivan and John Horan. 2007. Generating and solving logic puzzles through constraint satisfaction. In PROCEEDINGS OF THE NATIONAL CONF ON AI, Vol.\u00a022. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 1974."},{"key":"e_1_3_2_1_27_1","volume-title":"Ludii and XCSP: Playing and Solving Logic Puzzles. In 2019 IEEE Conference on Games (CoG). IEEE, 1\u20134.","author":"Piette C\u00e9dric","year":"2019","unstructured":"C\u00e9dric Piette , Eric Piette , Matthew Stephenson , Dennis\u00a0 JNJ Soemers , and Cameron Browne . 2019 . Ludii and XCSP: Playing and Solving Logic Puzzles. In 2019 IEEE Conference on Games (CoG). IEEE, 1\u20134. C\u00e9dric Piette, Eric Piette, Matthew Stephenson, Dennis\u00a0JNJ Soemers, and Cameron Browne. 2019. Ludii and XCSP: Playing and Solving Logic Puzzles. In 2019 IEEE Conference on Games (CoG). IEEE, 1\u20134."},{"doi-asserted-by":"crossref","unstructured":"C\u00e9dric Piette \u00c9ric Piette Matthew Stephenson Dennis\u00a0JNJ Soemers and Cameron Browne. 2019. Ludii and XCSP: Playing and Solving Logic Puzzles. arXiv preprint arXiv:1907.00245(2019). C\u00e9dric Piette \u00c9ric Piette Matthew Stephenson Dennis\u00a0JNJ Soemers and Cameron Browne. 2019. Ludii and XCSP: Playing and Solving Logic Puzzles. arXiv preprint arXiv:1907.00245(2019).","key":"e_1_3_2_1_28_1","DOI":"10.1109\/CIG.2019.8848086"},{"doi-asserted-by":"crossref","unstructured":"Eric Piette Dennis\u00a0JNJ Soemers Matthew Stephenson Chiara\u00a0F Sironi Mark\u00a0HM Winands and Cameron Browne. 2019. Ludii-the ludemic general game system. arXiv preprint arXiv:1905.05013(2019). Eric Piette Dennis\u00a0JNJ Soemers Matthew Stephenson Chiara\u00a0F Sironi Mark\u00a0HM Winands and Cameron Browne. 2019. Ludii-the ludemic general game system. arXiv preprint arXiv:1905.05013(2019).","key":"e_1_3_2_1_29_1","DOI":"10.1109\/CIG.2019.8847994"},{"unstructured":"Jacques Pitrat. 1968. Realization of a GGP program.. In IFIP congress (2). 1570\u20131574. Jacques Pitrat. 1968. Realization of a GGP program.. In IFIP congress (2). 1570\u20131574.","key":"e_1_3_2_1_30_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1109\/CIG.2014.6932920"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1016\/j.knosys.2011.08.008"},{"key":"e_1_3_2_1_33_1","volume-title":"Julian Schrittwieser, Ioannis Antonoglou","author":"Silver David","year":"2016","unstructured":"David Silver , Aja Huang , Chris\u00a0 J Maddison , Arthur Guez , Laurent Sifre , George Van Den\u00a0Driessche , Julian Schrittwieser, Ioannis Antonoglou , Veda Panneershelvam, Marc Lanctot , 2016 . Mastering the game of Go with deep neural networks and tree search. nature 529, 7587 (2016), 484. David Silver, Aja Huang, Chris\u00a0J Maddison, Arthur Guez, Laurent Sifre, George Van Den\u00a0Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, 2016. Mastering the game of Go with deep neural networks and tree search. nature 529, 7587 (2016), 484."},{"key":"e_1_3_2_1_34_1","volume-title":"The 15 puzzle book","author":"Slocum Jerry","year":"2006","unstructured":"Jerry Slocum and Dic Sonneveld . 2006. The 15 puzzle book . Slocum Puzzle Foundation( 2006 ). Jerry Slocum and Dic Sonneveld. 2006. The 15 puzzle book. Slocum Puzzle Foundation(2006)."}],"event":{"acronym":"ICCTA 2021","name":"ICCTA 2021: 2021 7th International Conference on Computer Technology Applications","location":"Vienna Austria"},"container-title":["2021 7th International Conference on Computer Technology Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477911.3477915","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477911.3477915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:37Z","timestamp":1750183837000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477911.3477915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,13]]},"references-count":34,"alternative-id":["10.1145\/3477911.3477915","10.1145\/3477911"],"URL":"https:\/\/doi.org\/10.1145\/3477911.3477915","relation":{},"subject":[],"published":{"date-parts":[[2021,7,13]]},"assertion":[{"value":"2021-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}