{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:56:52Z","timestamp":1762102612825,"version":"3.37.3"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,14]]},"DOI":"10.1109\/wsc48552.2020.9384090","type":"proceedings-article","created":{"date-parts":[[2021,3,29]],"date-time":"2021-03-29T22:03:21Z","timestamp":1617055401000},"page":"1178-1193","source":"Crossref","is-referenced-by-count":4,"title":["A Tutorial Introduction to Monte Carlo Tree Search"],"prefix":"10.1109","author":[{"given":"Michael C.","family":"Fu","sequence":"first","affiliation":[{"name":"A. V. Williams Building University of Maryland,Robert H. Smith School of Business,Van Munching Hall Institute for Systems Research,College Park,MD,USA,20742"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/203330.203343"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar6404"},{"key":"ref10","first-page":"24","article-title":"Google Deep Mind&#x2019;s AlphaGo","author":"chang","year":"0","journal-title":"OR\/MS Today"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008349927281"},{"key":"ref12","first-page":"72","article-title":"Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search","volume":"4630","author":"coulom","year":"2006","journal-title":"Computers and Games CG 2006 Lecture Notes in Computer Science"},{"journal-title":"DeepMind","year":"2018","key":"ref13"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-1384-8","author":"fu","year":"2015","journal-title":"Handbook of Simulation Optimization"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2016.7822130"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/educ.2017.0166"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2018.8632344"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595919400098"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1153-7","author":"gass","year":"2013","journal-title":"Encyclopedia of Operations Research and Management Science"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"journal-title":"Neuro-Dynamic Programming","year":"1996","author":"bertsekas","key":"ref4"},{"key":"ref27","article-title":"MathRec Solutions (Tic-Tac-Toe)","author":"schaefer","year":"2002","journal-title":"Mathematical Recreations"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1126\/science.aao1733"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.2.269"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0145"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"journal-title":"AlphaGo Movie","year":"2017","key":"ref2"},{"journal-title":"MCTS Tic-Tac-Toe Demo Program","year":"2020","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-690-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2307\/1914185"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9030099"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/11871842_29","article-title":"Bandit based Monte-Carlo Planning","volume":"4212","author":"kocsis","year":"2006","journal-title":"Machine Learning ECML 2006 ser Lecture Notes in Computer Science"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797188"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam6960"},{"key":"ref26","first-page":"1406","article-title":"Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control","author":"prashanth","year":"2016","journal-title":"ICML&#x2019;16 Proceedings of the 33rd International Conference on Machine Learning"},{"journal-title":"Approximate Dynamic Programming","year":"2010","author":"powell","key":"ref25"}],"event":{"name":"2020 Winter Simulation Conference (WSC)","start":{"date-parts":[[2020,12,14]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2020,12,18]]}},"container-title":["2020 Winter Simulation Conference (WSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9383852\/9383853\/09384090.pdf?arnumber=9384090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T09:55:55Z","timestamp":1698141355000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9384090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,14]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/wsc48552.2020.9384090","relation":{},"subject":[],"published":{"date-parts":[[2020,12,14]]}}}