{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:41:04Z","timestamp":1730209264548,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,17]]},"DOI":"10.1109\/cog52621.2021.9618896","type":"proceedings-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T15:53:06Z","timestamp":1638892386000},"page":"01-08","source":"Crossref","is-referenced-by-count":1,"title":["Playout Optimization for Monte-Carlo Search Algorithms. Application to Morpion Solitaire"],"prefix":"10.1109","author":[{"given":"Lilian","family":"Buzer","sequence":"first","affiliation":[{"name":"Universitè Gustave Eiffel, CNRS,LIGM,Marne-la-Vallèe,France,F-77454"}]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[{"name":"Universitè Paris-Dauphine, PSL, CNRS,LAMSADE,Paris,France"}]}],"member":"263","reference":[{"key":"ref10","first-page":"687","article-title":"Nested monte carlo search for two-player games","author":"cazenave","year":"2016","journal-title":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence"},{"key":"ref11","first-page":"147","article-title":"Finding differential paths in arx ciphers through nested monte-carlo search","volume":"64","author":"dwivedi","year":"2018","journal-title":"International Journal of Electronics and Telecommunications"},{"key":"ref12","first-page":"345587","article-title":"An unexpectedly effective monte carlo technique for the rna inverse folding problem","author":"portela","year":"2018","journal-title":"BioRxiv"},{"key":"ref13","first-page":"649","article-title":"Nested rollout policy adaptation for Monte Carlo Tree Search","author":"rosin","year":"2011","journal-title":"IJCAI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11206-0_28"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2014.6932882"},{"key":"ref18","article-title":"Monte-carlo tree search for the multiple sequence alignment problem","author":"edelkamp","year":"0","journal-title":"Eighth Annual Symposium on Combinatorial Search 2015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21266-1_28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2088123"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20520-0_51"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05428-5_1"},{"key":"ref5","first-page":"462","article-title":"A new approach to the snake-in-the-box problem","volume":"242","author":"kinny","year":"2012","journal-title":"ECAI 2012 ser Frontiers in Artificial Intelligence and Applications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754767"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598339"},{"key":"ref2","first-page":"456","article-title":"Nested Monte-Carlo Search","author":"cazenave","year":"2009","journal-title":"IJCAI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref9","first-page":"119","article-title":"Burnt pancake problem: New lower bounds on the diameter and new experimental optimality ratios","author":"bouzy","year":"2016","journal-title":"Proceedings of the Ninth Annual Symposium on Combinatorial Search SOCS 2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-201577"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89453-5_7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89453-5_8"},{"journal-title":"Boyer","article-title":"Morpion solitaire webpage","year":"0","key":"ref24"},{"key":"ref23","first-page":"36","article-title":"On the scalability of parallel UCT","volume":"6515","author":"segal","year":"2010","journal-title":"Computers and Games - 7th International Conference CG 2010 Kanazawa Japan September 24–26 2010 Revised Selected Papers ser Lecture Notes in Computer Science"},{"journal-title":"Fast random number generator on the Intel Pentium 4 processor","year":"2009","author":"owens","key":"ref26"},{"journal-title":"The microarchitecture of intel amd and via cpus An optimization guide","year":"0","author":"agner","key":"ref25"}],"event":{"name":"2021 IEEE Conference on Games (CoG)","start":{"date-parts":[[2021,8,17]]},"location":"Copenhagen, Denmark","end":{"date-parts":[[2021,8,20]]}},"container-title":["2021 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9618888\/9618891\/09618896.pdf?arnumber=9618896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T20:14:15Z","timestamp":1659471255000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9618896\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cog52621.2021.9618896","relation":{},"subject":[],"published":{"date-parts":[[2021,8,17]]}}}