{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T02:30:13Z","timestamp":1775788213478,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"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":[[2019,8]]},"DOI":"10.1109\/cig.2019.8848122","type":"proceedings-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:49:14Z","timestamp":1569548954000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Evaluating the Complexity of Players\u2019 Strategies using MCTS Iterations"],"prefix":"10.1109","author":[{"given":"Pier Luca","family":"Lanzi","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633628"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2015.7317937"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.007"},{"key":"ref13","first-page":"2514","article-title":"Modifying MCTS for human-like general video game playing","author":"khalifa","year":"2016","journal-title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence IJCAI 2016"},{"key":"ref14","first-page":"282","author":"kocsis","year":"2006","journal-title":"Bandit Based Monte Carlo Planning"},{"key":"ref15","first-page":"1202","article-title":"Finding optimal solutions to the twenty-four puzzle","volume":"2","author":"korf","year":"1996","journal-title":"Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference AAAI 96 IAAI 96"},{"key":"ref16","article-title":"Databases in awari","author":"den herik lv allis","year":"1991","journal-title":"Heuristic Programming in Artificial Intelligence"},{"key":"ref17","article-title":"Computing your skill","author":"moser","year":"2010"},{"key":"ref18","author":"mountain","year":"2015","journal-title":"Tactical planning and real-time mcts in fable legends"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2016.7860443"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref6","year":"0","journal-title":"Fuego"},{"key":"ref5","author":"champanard","year":"2014","journal-title":"Monte-Carlo Tree Search in Total War Rome II&#x2019;s Campaign ai"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref7","first-page":"72","article-title":"Efficient selectivity and backup operators in monte-carlo tree search","author":"coulom","year":"2006","journal-title":"Computers and Games 5th International Conference CG 2006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2067212"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2204883"},{"key":"ref1","first-page":"569","author":"tom","year":"2007","journal-title":"TrueSkill (TM) A Bayesian Skill Rating System"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032002"},{"key":"ref22","article-title":"Integrating opponent models with monte-carlo tree search in poker","author":"ponsen","year":"2010","journal-title":"Interactive Decision Theory and Game Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2018.2834618"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1038\/nature16961","article-title":"Mastering the game of go with deep neural networks and tree search","volume":"529","author":"silver","year":"2016","journal-title":"Nature"},{"key":"ref23","author":"russ","year":"2000","journal-title":"The complete mancala games book"},{"key":"ref26","article-title":"Lucas. Evaluating and modelling hanabi-playing agents","volume":"abs 1704 7069","author":"walton-rivers","year":"2017","journal-title":"CoRR"},{"key":"ref25","first-page":"21","article-title":"Monte-carlo tree search in settlers of catan","author":"szita","year":"2009","journal-title":"Advances in Computer Games 12th International Conference ACG 2009"}],"event":{"name":"2019 IEEE Conference on Games (CoG)","location":"London, United Kingdom","start":{"date-parts":[[2019,8,20]]},"end":{"date-parts":[[2019,8,23]]}},"container-title":["2019 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8844551\/8847948\/08848122.pdf?arnumber=8848122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:47:04Z","timestamp":1658155624000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8848122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cig.2019.8848122","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}