{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T16:21:50Z","timestamp":1788020510823,"version":"build-2784847793"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["612.000.938"],"award-info":[{"award-number":["612.000.938"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1109\/tciaig.2015.2443123","type":"journal-article","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T18:50:57Z","timestamp":1433962257000},"page":"301-314","source":"Crossref","is-referenced-by-count":10,"title":["Time Management for Monte Carlo Tree Search"],"prefix":"10.1109","volume":"8","author":[{"given":"Hendrik","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.38"},{"key":"ref11","article-title":"Criticality: a Monte-Carlo heuristic for Go programs","author":"coulom","year":"2009"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2009-32305"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/001316446002000104"},{"key":"ref14","article-title":"Orego Go program","author":"drake","year":"2011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035667"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1465611.1465715"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"ref18","author":"gelly","year":"2006","journal-title":"?Modification of UCT with patterns in Monte-Carlo Go ?"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2100396"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1996.tb00254.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/320435.320514"},{"key":"ref6","author":"baudi?","year":"2011","journal-title":"MCTS with information sharing"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.3233\/ICG-2009-32403","article-title":"Time management during a chess game","volume":"32","author":"?olak","year":"2009","journal-title":"ICGA J"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31866-5_4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.78"},{"key":"ref2","first-page":"31","article-title":"A la recherche du temps perdu: ?That was easy?","volume":"17","author":"donninger","year":"1994","journal-title":"ICCA J"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45579-5_11"},{"key":"ref1","first-page":"285","volume":"7","author":"alth\ufffdfer","year":"1994","journal-title":"Advances in Computer Chess"},{"key":"ref20","year":"2009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref21","first-page":"23","article-title":"Game-tree properties and MCTS performance","author":"finnsson","year":"2011","journal-title":"Proc IJCAI Workshop Gen Intell Game Playing Agents"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633630"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1609\/icaps.v20i1.13437","article-title":"On adversarial search spaces and sampling-based planning","author":"ramanujan","year":"2010","journal-title":"Proc Int Conf Autom Planning Scheduling"},{"key":"ref25","first-page":"559","article-title":"Sufficiency-based selection strategy for MCTS","author":"gudmundsson","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/7565675\/07120913.pdf?arnumber=7120913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:02:00Z","timestamp":1748437320000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7120913\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":25,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2015.2443123","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}