{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T15:46:48Z","timestamp":1790696808125,"version":"4.1.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1109\/cig.2011.6032021","type":"proceedings-article","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T14:19:54Z","timestamp":1317824394000},"page":"305-312","source":"Crossref","is-referenced-by-count":15,"title":["Learning non-random moves for playing Othello: Improving Monte Carlo Tree Search"],"prefix":"10.1109","author":[{"given":"David","family":"Robles","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Rohlfshagen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon M.","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","first-page":"1","article-title":"Learning to play othello with n-tuple systems","author":"lucas","year":"2008","journal-title":"Australian Journal of Intelligent Information Processing"},{"key":"17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-87608-3_2","article-title":"Amazons discover monte-carlo","author":"lorentz","year":"2008","journal-title":"Computers and Games"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2006.311681"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_8"},{"key":"16","first-page":"282","article-title":"Bandit based Monte-Carlo planning","volume":"4212 lnai","author":"kocsis","year":"2006","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"13","first-page":"605","article-title":"All-moves-as-first heuristics in monte-carlo go","author":"helmbold","year":"2009","journal-title":"Proceedings of the 2009 International Conference on Artificial Intelligence"},{"key":"14","first-page":"4059","article-title":"Experiments with Monte Carlo othello","author":"hingston","year":"2008","journal-title":"Evolutionary Computation 2007 CEC 2007-IEEE Congress on"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.007"},{"key":"12","author":"gelly","year":"2006","journal-title":"Modification of UCT with patterns in Monte-Carlo Go"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035641"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDAR.2005.109"},{"key":"22","author":"schaeffer","year":"2008","journal-title":"One Jump Ahead Computer Perfection at Checkers"},{"key":"23","first-page":"529","article-title":"Temporal difference learning applied to a high-performance game-playing program","author":"schaeffer","year":"2001","journal-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence"},{"key":"24","author":"silver","year":"2009","journal-title":"Reinforcement Learning and Simulation-Based Search"},{"key":"25","article-title":"Reinforcement learning of local shape in the game of go","author":"silver","year":"2007","journal-title":"Proceedings of the Joint International Conference for Artificial Intelligence"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553495"},{"key":"27","author":"sutton","year":"1998","journal-title":"Reinforcement Learning An Introduction"},{"key":"28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01551-9","author":"szepesva?ri","year":"2010","journal-title":"Algorithms for Reinforcement Learning"},{"key":"3","first-page":"84","article-title":"Experiments in parameter learning using temporal differences","volume":"21","author":"baxter","year":"1998","journal-title":"Int Comput Chess Assoc J"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/34.44404"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35660-0_10"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48957-6_8"},{"key":"5","first-page":"1","article-title":"LOGISTELLO: A strong learning othello program","author":"buro","year":"1995","journal-title":"19th Annual Conference Gesellschaft fu?r Klassifikation E V"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2009.2018702"},{"key":"9","first-page":"72","article-title":"Efficient selectivity and backup operators in monte-carlo tree search","author":"coulom","year":"2006","journal-title":"Proceedings of the 5th International Conference on Computers and Games"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00129-1"}],"event":{"name":"2011 IEEE Conference on Computational Intelligence and Games (CIG)","location":"Seoul, Korea (South)","start":{"date-parts":[[2011,8,31]]},"end":{"date-parts":[[2011,9,3]]}},"container-title":["2011 IEEE Conference on Computational Intelligence and Games (CIG'11)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026199\/6031971\/06032021.pdf?arnumber=6032021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T08:09:12Z","timestamp":1686384552000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6032021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/cig.2011.6032021","relation":{},"subject":[],"published":{"date-parts":[[2011,8]]}}}