{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:29:09Z","timestamp":1759667349382},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"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":[[2010,12]]},"DOI":"10.1109\/tciaig.2010.2061050","type":"journal-article","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T00:34:43Z","timestamp":1280363683000},"page":"239-250","source":"Crossref","is-referenced-by-count":46,"title":["Monte Carlo Tree Search in Lines of Action"],"prefix":"10.1109","volume":"2","author":[{"given":"Mark H. M.","family":"Winands","sequence":"first","affiliation":[]},{"given":"Yngvi","family":"Bjornsson","sequence":"additional","affiliation":[]},{"given":"Jahn-Takeshi","family":"Saito","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref38","year":"0","journal-title":"Lines of Action Wikipage"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45517-5_6"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45579-5_11"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00056-2"},{"key":"ref30","author":"dyer","year":"2000","journal-title":"Lines of Action Homepage"},{"key":"ref37","author":"hashimoto","year":"2003","journal-title":"Automatic realization-probability search"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(03)00047-1"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(03)00046-X"},{"key":"ref34","author":"bjrnsson","year":"2002","journal-title":"Selective depth-first game-tree search"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(99)00097-3"},{"key":"ref27","first-page":"123","article-title":"adaptive null-move pruning","volume":"22","author":"heinz","year":"1999","journal-title":"Int Comput Chess Assoc J"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2004.04.011"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/11871842_29","volume":"4212","author":"kocsis","year":"2006","journal-title":"Machine Learning ECML 2006"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume":"4630","author":"coulom","year":"2007","journal-title":"Computers and Games (CG 2006)"},{"key":"ref20","first-page":"232","author":"allis","year":"1991","journal-title":"Heuristic Programming in Artificial Intelligence 2 The Second Computer Olympiad"},{"key":"ref22","author":"winands","year":"2000","journal-title":"Analysis and implementation of Lines of Action"},{"key":"ref21","first-page":"234","article-title":"6<formula formulatype=\"inline\"> <tex notation=\"tex\">$\\, \\times \\,$<\/tex><\/formula>6 loa is solved","volume":"31","author":"winands","year":"2008","journal-title":"Int Comput Games Assoc J"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/228329.228344"},{"key":"ref23","first-page":"175","article-title":"replacement schemes and two-level tables","volume":"19","author":"breuker","year":"1996","journal-title":"Int Comput Chess Assoc J"},{"key":"ref26","first-page":"137","article-title":"null move and deep search: selective-search heuristics for obtuse chess programs","volume":"16","author":"donninger","year":"1993","journal-title":"Int Comput Chess Assoc J"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/800179.810240"},{"key":"ref50","article-title":"old-fashioned computer go vs monte-carlo go","author":"bouzy","year":"2007","journal-title":"Proc IEEE Symp Comput Intell Games"},{"key":"ref51","first-page":"84","article-title":"mia: a world champion loa program","author":"winands","year":"2006","journal-title":"Proc 11th Game Programming Workshop"},{"key":"ref54","author":"steinhauer","year":"2010","journal-title":"Monte-Carlo TwixT"},{"key":"ref53","author":"allis","year":"1994","journal-title":"Searching for Solutions in Games and Artificial Intelligence"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/11674399_18"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3166\/ria.23.183-202"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-87608-3_2","volume":"5131","author":"lorentz","year":"2008","journal-title":"Computers and Games (CG 2008)"},{"key":"ref40","first-page":"132","article-title":"game-tree search algorithm based on realization probability","volume":"25","author":"tsuruoka","year":"2002","journal-title":"Int Comput Games Assoc J"},{"key":"ref12","first-page":"21","article-title":"Simulation control in general game playing agents","author":"finnsson","year":"2009","journal-title":"Proc IJCAI Workshop General Game Playing"},{"key":"ref13","author":"sackson","year":"1969","journal-title":"A Gamut of Games"},{"key":"ref14","author":"winands","year":"2004","journal-title":"Informed search in complex games"},{"key":"ref15","first-page":"117","author":"helmstetter","year":"2006","journal-title":"Intelligence Artificielle et Jeux"},{"key":"ref16","first-page":"231","author":"billings","year":"2003","journal-title":"Advances in Computer Games 10 Many Games Many Challenges"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-87608-3_3","volume":"5131","author":"winands","year":"2008","journal-title":"Computers and Games (CG 2008)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12993-3_4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2061050"},{"key":"ref4","first-page":"159","author":"bouzy","year":"2003","journal-title":"Advances in Computer Games 10 Many Games Many Challenges"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/34.44404"},{"key":"ref6","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":"ref5","author":"brgmann","year":"1993","journal-title":"Monte Carlo Go"},{"key":"ref8","first-page":"259","article-title":"Simulation-based approach to general game playing","author":"finnsson","year":"2008","journal-title":"Proc 23rd AAAI Conf Artif Intell"},{"key":"ref7","first-page":"1407","article-title":"improving state evaluation, inference, and search in trick-based card games","author":"buro","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035665"},{"key":"ref9","first-page":"165","article-title":"golois wins phantom go tournament","volume":"30","author":"cazenave","year":"2007","journal-title":"Int Comput Games Assoc J"},{"key":"ref46","first-page":"244","article-title":"The parallelization of Monte-Carlo planning&#x2014;Parallelization of MCplanning","author":"gelly","year":"2008","journal-title":"Proc 5th Int Conf Inf Control Autom Robot Intell Control Syst Optim"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-540-87608-3_6","volume":"5131","author":"chaslot","year":"2008","journal-title":"Computers and Games (CG 2008)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1142\/9789812709677_0247"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-642-12993-3_2","volume":"6048","author":"enzenberger","year":"2010","journal-title":"Advances in Computer Games (ACG 2009)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001070"},{"key":"ref41","article-title":"enhancements for multiplayer monte-carlo tree search","author":"nijssen","year":"2010","journal-title":"Computer and Games (CG 2010)"},{"key":"ref44","first-page":"93","article-title":"on the parallelization of uct","author":"cazenave","year":"2007","journal-title":"Proc Comput Games Workshop"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4804728\/5688732\/05523941.pdf?arnumber=5523941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:44:05Z","timestamp":1633913045000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5523941\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":54,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2010.2061050","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}