{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T12:34:48Z","timestamp":1793190888375,"version":"4.5.0"},"reference-count":241,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/tciaig.2012.2186810","type":"journal-article","created":{"date-parts":[[2012,2,3]],"date-time":"2012-02-03T16:01:52Z","timestamp":1328284912000},"page":"1-43","source":"Crossref","is-referenced-by-count":2270,"title":["A Survey of Monte Carlo Tree Search Methods"],"prefix":"10.1109","volume":"4","author":[{"given":"Cameron B.","family":"Browne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward","family":"Powley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Whitehouse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon M.","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter I.","family":"Cowling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Rohlfshagen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Tavener","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Diego","family":"Perez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyridon","family":"Samothrakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Colton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1a","volume-title":"Entries marked with an asterisk (*) denote support material that does not directly cite MCTS methods"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/34.44404"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.37"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90004-3"},{"key":"ref5","volume-title":"On the laziness of Monte-Carlo game tree search in non-tight situations","author":"Alth\u00f6fer","year":"2008"},{"key":"ref6","volume-title":"\u201cGame self-play with pure Monte-Carlo: The basin structure","author":"Alth\u00f6fer","year":"2010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2009-32218"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2067212"},{"key":"ref9","article-title":"Approaching Bayes-optimalilty using Monte-Carlo tree search","volume-title":"Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched.","author":"Asmuth"},{"key":"ref10","first-page":"19","article-title":"Learning is planning: Near Bayes-optimal reinforcement learning via Monte-Carlo tree search","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Asmuth"},{"key":"ref11","first-page":"773","article-title":"Minimax policies for adversarial and stochastic bandits","volume-title":"Proc. 22nd Annu. Conf. Learn. Theory","author":"Audibert"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01129-0_36"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9244-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20525-5_6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2100396"},{"key":"ref18","first-page":"40","article-title":"UCT for tactical assault planning in real-time strategy games","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Balla"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13800-3_9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v19i1.13363"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2009.2018702"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v2i1.18197"},{"key":"ref23","first-page":"57","article-title":"A comparison of Monte-Carlo methods for phantom Go","volume-title":"Proc. BeNeLux Conf. Artif. Intell.","author":"Borsboom"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5220\/0002949901690173"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11922155_8"},{"key":"ref27","volume-title":"Analysis and implementation of the Game OnTop","author":"Briesemeister","year":"2009"},{"key":"ref28","volume-title":"Automatic generation and evaluation of recombination games","author":"Browne","year":"2008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3233\/icg-2011-34105"},{"key":"ref30","first-page":"96","article-title":"Towards MCTS for creative domains","volume-title":"Proc. Int. Conf. Comput. Creat.","author":"Browne"},{"key":"ref31","volume-title":"Monte Carlo Go","author":"Br\u00fcgmann","year":"1993"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.059"},{"key":"ref33","first-page":"201","article-title":"Online optimization in x-armed bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"22","author":"Bubeck"},{"key":"ref34","first-page":"1587","article-title":"X-armed bandits","volume":"12","author":"Bubeck","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref35","first-page":"1407","article-title":"Improving state evaluation, inference, and search in trick-based card games","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Buro"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11922155_9"},{"key":"ref37","volume-title":"Evolving Monte-Carlo tree search algorithms","author":"Cazenave","year":"2007"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2007-30104"},{"key":"ref39","first-page":"165","article-title":"Reflexive Monte-Carlo search","volume-title":"Proc. Comput. Games Workshop","author":"Cazenave"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_5"},{"key":"ref41","first-page":"45","article-title":"Monte-Carlo Kakuro","volume-title":"Proc. Adv. Comput. Games","author":"Cazenave"},{"key":"ref42","first-page":"456","article-title":"Nested Monte-Carlo search","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Cazenave"},{"key":"ref43","first-page":"1057","article-title":"Nested Monte-Carlo expression discovery","volume-title":"Proc. Eur. Conf. Artif. Intell.","author":"Cazenave"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/9780511820809.004"},{"key":"ref45","first-page":"340","article-title":"Monte-Carlo bus regulation","volume-title":"Proc. Int. IEEE Conf. Intell. Trans. Syst.","author":"Cazenave"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2007-30311"},{"key":"ref47","first-page":"93","article-title":"On the parallelization of UCT","volume-title":"Proc. Comput. Games Workshop","author":"Cazenave"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_7"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ipdps.2009.5161122"},{"key":"ref50","article-title":"Monte-Carlo Hex","volume-title":"Proc. Board Games Studies Colloq.","author":"Cazenave"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_9"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v4i1.18700"},{"key":"ref53","volume-title":"Combining expert, offline, transient and online knowledge in Monte-Carlo exploration","author":"Chaslot","year":"2008"},{"key":"ref54","first-page":"91","article-title":"Monte-Carlo tree search in production management problems","volume-title":"Proc. BeNeLux Conf. Artif. Intell.","author":"Chaslot"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_1"},{"key":"ref56","first-page":"7","article-title":"Meta Monte-Carlo tree search for automatic opening book generation","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Chaslot"},{"key":"ref57","article-title":"On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers","volume-title":"Proc. Eur. Symp. Artif. Neural Netw.","author":"Chaslot"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2008-31303"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_6"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04141-9_10"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.3115\/1667583.1667660"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035667"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20525-5_8"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032012"},{"key":"ref66","first-page":"474","article-title":"Monte Carlo tree search techniques in the game of Kriegspiel","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Ciancarini"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.017"},{"key":"ref68","first-page":"67","article-title":"Bandit algorithms for tree search","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Coquelin"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_32"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2007-30403"},{"key":"ref72","first-page":"74","article-title":"Monte-Carlo tree search in crazy stone","volume-title":"Proc. Game Prog. Workshop","author":"Coulom"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553468"},{"key":"ref74","volume-title":"Monte-Carlo tree search for the simultaneous move game Tron","author":"Den Teuling","year":"2011"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2009-32404"},{"key":"ref76","first-page":"171","article-title":"Heuristics in Monte Carlo Go","volume-title":"Proc. Int. Conf. Artif. Intell.","author":"Drake"},{"key":"ref77","first-page":"35","article-title":"Move ordering vs heavy playouts: Where should heuristics be applied in Monte Carlo Go","volume-title":"Proc. 3rd North Amer. Game-On Conf.","author":"Drake"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.17875\/gup2010-1477"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/tciaig.2010.2083662"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_2"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2083662"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v21i1.13458"},{"key":"ref83","volume-title":"CADIA-Player: A general game playing agent","author":"Finnsson","year":"2007"},{"key":"ref84","first-page":"259","article-title":"Simulation-based approach to general game playing","volume-title":"Proc. Assoc. Adv. Artif. Intell.","author":"Finnsson"},{"key":"ref85","first-page":"21","article-title":"Simulation control in general game playing agents","volume-title":"Proc. Int. Joint Conf. Artif. Intell. Workshop Gen. Game Playing","author":"Finnsson"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7651"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-010-0080-9"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2009.746"},{"key":"ref89","first-page":"359","article-title":"Feature selection as a one-player game","volume-title":"Proc. 27th Int. Conf. Mach. Learn.","author":"Gaudel"},{"key":"ref90","volume-title":"A contribution to reinforcement learning; Application to computer-Go","author":"Gelly","year":"2007"},{"key":"ref91","first-page":"244","article-title":"The parallelization of Monte-Carlo planning","volume-title":"Proc. 5th Int. Conf. Inf. Control Autom. Robot.","author":"Gelly"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"ref93","first-page":"1537","article-title":"Achieving master level play in 9$\\,\\times\\,$9 computer Go","volume-title":"Proc. Assoc. Adv. Artif. Intell.","volume":"1","author":"Gelly"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.007"},{"key":"ref95","article-title":"Exploration exploitation in Go: UCT for Monte-Carlo Go","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gelly"},{"key":"ref96","volume-title":"Modification of UCT with patterns in Monte-Carlo Go","author":"Gelly","year":"2006"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1613\/jair.820"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23397-5_36"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/CIMCA.2008.82"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/CIMCA.2008.81"},{"key":"ref101","first-page":"605","article-title":"All-moves-as-first heuristics in Monte-Carlo Go","volume-title":"Proc. Int. Conf. Artif. Intell.","author":"Helmbold"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032014"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4425000"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2010.938360"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12148-7_23"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.38"},{"key":"ref107","volume-title":"New heuristics for Monte Carlo tree search applied to the Game of Go","author":"Huang","year":"2011"},{"issue":"4","key":"ref108","first-page":"191","article-title":"Monte-Carlo simulation balancing applied to 9$\\,\\times\\,$9 Go","volume":"33","author":"Huang","year":"2010","journal-title":"Int. Comput. Games Assoc. J."},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_8"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.78"},{"key":"ref111","first-page":"1","article-title":"Monte Carlo tree search in Ms. Pac-Man","volume-title":"Proc. 15th Game Progr. Workshop","author":"Ikehata"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6031987"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.83"},{"issue":"6","key":"ref114","first-page":"1","article-title":"Experiments in Monte-Carlo amazons","volume":"2010-GI-24","author":"Kloetzer","year":"2010","journal-title":"J. Inf. Process. Soc. Jpn."},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_12"},{"key":"ref116","first-page":"113","article-title":"The Monte-Carlo approach in amazons","volume-title":"Proc. Comput. Games Workshop","author":"Kloetzer"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035665"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2009-32303"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref120","volume-title":"Improved Monte-Carlo search","author":"Kocsis","year":"2006"},{"key":"ref121","volume-title":"Efficient playouts for the Havannah abstract board game","author":"K\u00f6nnecke","year":"2009"},{"key":"ref122","volume-title":"Methods of MCTS and the game Arimaa","author":"Kozelek","year":"2009"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1145\/1978542.1978548"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref125","first-page":"1078","article-title":"Monte Carlo sampling for regret minimization in extensive games","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lanctot"},{"key":"ref126","volume-title":"Rapidly-exploring random trees: A new tool for path planning","author":"LaValle","year":"1998"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2099154"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2009.2018703"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZY.2009.5277222"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7562"},{"key":"ref131","volume-title":"Rybka\u2019s Monte Carlo analysis","author":"Lopez","year":"2008"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_2"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_10"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.3233\/icg-2010-33411"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032004"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20525-5_10"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-58603-891-5-458"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v21i1.13484"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.65109\/VILR5324"},{"key":"ref140","first-page":"2086","article-title":"Evaluation of simulation strategy on single-player Monte-Carlo tree search and its discussion for a practical scheduling problem","volume-title":"Proc. Int. Multi Conf. Eng. Comput. Scientists","volume":"3","author":"Matsumoto"},{"key":"ref141","volume-title":"Multi-armed bandit Bayesian decision making","author":"McInerney","year":"2010"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1163\/1573-3912_ei2glos_sim_gi_00259"},{"key":"ref143","volume-title":"Monte-Carlo tree search for general game playing","author":"M\u00e9hat","year":"2008"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2088123"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-010-0083-6"},{"key":"ref146","first-page":"39","article-title":"Tree parallelization of Ary on a cluster","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"M\u00e9hat"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-010-0077-4"},{"key":"ref148","volume-title":"Fuego-GB prototype at the Human Machine Competition in Barcelona 2010: A Tournament Report and Analysis","author":"M\u00fcller","year":"2010"},{"key":"ref149","first-page":"1766","article-title":"Monte-Carlo exploration for deterministic planning","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell.","author":"Nakhost"},{"key":"ref150","first-page":"125","article-title":"Monte-Carlo planning for pathfinding in real-time strategy games","volume-title":"Proc. 28th Workshop U.K. Spec. Int. Group Plan. Sched.","author":"Naveed"},{"key":"ref151","volume-title":"ICE gUCT","author":"Nguyen","year":"2011"},{"key":"ref152","first-page":"1","article-title":"Playing Othello using Monte Carlo","author":"Nijssen","year":"2007","journal-title":"Strategies"},{"key":"ref153","volume-title":"Using intelligent search techniques to play the game Khet","author":"Nijssen","year":"2009"},{"key":"ref154","volume-title":"Using intelligent search techniques to play the game Khet","author":"Nijssen","year":"2009"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_22"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032002"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035641"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12384-9_26"},{"key":"ref159","first-page":"37","article-title":"Integrating opponent models with Monte-Carlo tree search in poker","volume-title":"Proc. Conf. Assoc. Adv. Artif. Intell., Inter. Decision Theory Game Theory Workshop","author":"Ponsen"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23954-0_18"},{"key":"ref161","first-page":"89","article-title":"Application of UCT search to the connection games of hex, Y, *Star, and Renkula!","volume-title":"Proc. Finn. Artif. Intell. Conf.","author":"Raiko"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v20i1.13437"},{"key":"ref163","first-page":"474","article-title":"Understanding sampling style adversarial search methods","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Ramanujan"},{"key":"ref164","article-title":"On the behavior of UCT in synthetic search spaces","volume-title":"Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched.","author":"Ramanujan"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v21i1.13472"},{"key":"ref166","volume-title":"Improvements and evaluation of the Monte-Carlo tree search algorithm","author":"Rimmel","year":"2009"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12239-2_21"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20520-0_51"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_6"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2098876"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2009.5286469"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032021"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04174-7_20"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570255"},{"key":"ref175","article-title":"Upper confidence trees and billiards for optimal active learning","volume-title":"Proc. Conf. l\u2019Apprentissage Autom.","author":"Rolet"},{"key":"ref176","first-page":"649","article-title":"Nested rollout policy adaptation for Monte Carlo tree search","volume-title":"Proc. 22nd Int. Joint Conf. Artif. Intell.","author":"Rosin"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.12.005"},{"key":"ref178","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell","year":"2009"},{"key":"ref179","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-29828-8_23","article-title":"Guiding combinatorial optimization with UCT","volume-title":"Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched.","author":"Sabharwal"},{"key":"ref180","volume-title":"Utilisation dUCT au Hex","author":"Saffidine","year":"2008"},{"key":"ref181","volume-title":"Some improvements for Monte-Carlo tree search, game description language compilation, score bounds and transpositions","author":"Saffidine","year":"2010"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.79"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_5"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2010.5593331"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2011.2144597"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2010-33203"},{"key":"ref187","first-page":"655","article-title":"Real-time solving of quantified CSPs based on Monte-Carlo game tree search","volume-title":"Proc. 22nd Int. Joint Conf. Artif. Intell.","author":"Satomi"},{"key":"ref188","volume-title":"Monte-Carlo search techniques in the modern board game Thurn and Taxis","author":"Schadd","year":"2009"},{"key":"ref189","doi-asserted-by":"crossref","DOI":"10.26481\/dis.20110525ms","volume-title":"Selective search in games of different complexity","author":"Schadd","year":"2011"},{"key":"ref190","first-page":"55","article-title":"Addressing NP-complete puzzles with Monte-Carlo methods","volume-title":"Proc. Artif. Intell. Simul. Behav. Symp. Logic Simul. Interact. Reason.","author":"Schadd"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_1"},{"key":"ref192","article-title":"UCT-treesplit-parallel MCTS on distributed memory","volume-title":"Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched.","author":"Schaefers"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1109\/34.42858"},{"key":"ref194","volume-title":"The UCT algorithm applied to games with imperfect information","author":"Sch\u00e4fer","year":"2008"},{"key":"ref195","first-page":"36","article-title":"On the scalability of parallel UCT","volume-title":"Proc. Comput. Games","author":"Segal"},{"key":"ref196","article-title":"Comparing UCT versus CFR in simultaneous games","volume-title":"Proc. Int. Joint Conf. Artif. Intell. Workshop Gen. Game Playing","author":"Shafiei"},{"key":"ref197","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89378-3_5"},{"key":"ref198","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035658"},{"key":"ref199","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0004-3702(01)00166-7","article-title":"World-championship-caliber scrabble","volume":"134","author":"Sheppard","year":"2002","journal-title":"Artif. Intell."},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035638"},{"key":"ref201","volume-title":"Reinforcement learning and simulation-based search in computer Go","author":"Silver","year":"2009"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390278"},{"key":"ref203","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553495"},{"key":"ref204","first-page":"1","article-title":"Monte-Carlo planning in large POMDPs","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Silver"},{"key":"ref205","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2096427"},{"key":"ref206","volume-title":"Knowledge-based Monte-Carlo tree search in Havannah","author":"Stankiewicz","year":"2011"},{"key":"ref207","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_4"},{"key":"ref208","first-page":"804","article-title":"A linear classifier outperforms UCT in 9$\\,\\times\\,$9 Go","volume-title":"Proc. Int. Conf. Artif. Intell.","author":"Sylvester"},{"key":"ref209","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_3"},{"key":"ref210","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035639"},{"key":"ref211","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2102022"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1109\/btas.2009.5339016"},{"key":"ref213","first-page":"580","article-title":"Bayesian inference in Monte-Carlo tree search","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Tesauro"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_7"},{"key":"ref215","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2010.5593334"},{"key":"ref216","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032013"},{"key":"ref217","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20525-5_16"},{"key":"ref218","volume-title":"Investigating UCT and RAVE: steps towards a more robust method","author":"Tom","year":"2010"},{"key":"ref219","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_6"},{"key":"ref220","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_7"},{"key":"ref221","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6031983"},{"key":"ref222","doi-asserted-by":"publisher","DOI":"10.1109\/icegic.2010.5716879"},{"key":"ref223","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05224-8_28"},{"issue":"2","key":"ref224","first-page":"65","article-title":"The Drosophila revisited","volume":"33","author":"van den Herik","year":"2010","journal-title":"Int. Comput. Games Assoc. J."},{"key":"ref225","first-page":"175","article-title":"Monte-Carlo tree search in Backgammon","volume-title":"Proc. Comput. Games Workshop","author":"van Lishout"},{"key":"ref226","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3125"},{"key":"ref227","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7689"},{"key":"ref228","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2007.368095"},{"key":"ref229","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2009.5286501"},{"key":"ref230","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6031993"},{"key":"ref231","volume-title":"Determining game quality through UCT tree shape analysis","author":"Williams","year":"2010"},{"key":"ref232","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_4"},{"key":"ref233","doi-asserted-by":"publisher","DOI":"10.1109\/cig.2011.6031996"},{"key":"ref234","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_3"},{"key":"ref235","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2061050"},{"key":"ref236","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2061050"},{"key":"ref237","doi-asserted-by":"publisher","DOI":"10.1109\/IITA.2009.331"},{"key":"ref238","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.8039"},{"key":"ref239","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2009.710"},{"key":"ref240","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2010.5583721"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4804728\/6169178\/06145622.pdf?arnumber=6145622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T04:15:03Z","timestamp":1792901703000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6145622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":241,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2012.2186810","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}