{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:58:47Z","timestamp":1778497127394,"version":"3.51.4"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"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":[[2020,8]]},"DOI":"10.1109\/cog47356.2020.9231603","type":"proceedings-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T14:05:50Z","timestamp":1603289150000},"page":"550-557","source":"Crossref","is-referenced-by-count":10,"title":["Guiding Multiplayer MCTS by Focusing on Yourself"],"prefix":"10.1109","author":[{"given":"Hendrik","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaisers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3402942.3402957"},{"key":"ref12","first-page":"125","article-title":"Improving best-reply search","volume":"8427","author":"esser","year":"2013","journal-title":"8th International Conference on Computers and Games (CG 2013) ser Lecture Notes in Computer Science"},{"key":"ref13","article-title":"Multi-Player Search in the Game of Billabong","author":"gras","year":"2012","journal-title":"Master&#x2019;s thesis"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2013-36102"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref16","first-page":"282","article-title":"Bandit Based Monte-Carlo Planning","volume":"4212","author":"kocsis","year":"2006","journal-title":"17th European Conference on Machine Learning (ECML 2006) ser Lecture Notes in Computer Science"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7651","article-title":"Learning Simulation Control in General Game-Playing Agents","author":"finnsson","year":"2010","journal-title":"Twenty-fourth AAAI Conference on Artificial Intelligence (AAAI-10)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200252"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar6404"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1038\/nature24270","article-title":"Mastering the Game of Go without Human Knowledge","volume":"550","author":"silver","year":"2017","journal-title":"Nature"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2011.2107323"},{"key":"ref5","first-page":"201","article-title":"On Pruning Techniques for Multi-Player Games","author":"sturtevant","year":"2000","journal-title":"17th National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence"},{"key":"ref8","article-title":"Thinking Fast and Slow with Deep Learning and Tree Search","author":"anthony","year":"2017","journal-title":"CoRR"},{"key":"ref7","article-title":"Monte-Carlo Tree Search for Multi-Player Games","author":"nijssen","year":"2013","journal-title":"Ph D Dissertation"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2402393"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2007-30403"},{"key":"ref1","article-title":"Generalized Monte-Carlo Tree Search Extensions for General Game Playing","author":"finnsson","year":"2012","journal-title":"Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12)"},{"key":"ref20","first-page":"158","article-title":"An Algorithmic Solution of N-Person Games","author":"luckhart","year":"1986","journal-title":"National Conference on Artificial Intelligence"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.007"},{"key":"ref21","first-page":"65","article-title":"Creating an Upper-Confidence-Tree Program for Havannah","volume":"6048","author":"teytaud","year":"2009","journal-title":"12th International Conference on Advances in Computer Games (ACG 2009) ser Lecture Notes in Computer Science"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-1983-6305"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2008-31402"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/800179.810240"}],"event":{"name":"2020 IEEE Conference on Games (CoG)","location":"Osaka, Japan","start":{"date-parts":[[2020,8,24]]},"end":{"date-parts":[[2020,8,27]]}},"container-title":["2020 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9222389\/9231525\/09231603.pdf?arnumber=9231603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:22:09Z","timestamp":1669249329000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9231603\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/cog47356.2020.9231603","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}