{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T22:31:38Z","timestamp":1771885898284,"version":"3.50.1"},"reference-count":47,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"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":[[2021,8,17]]},"DOI":"10.1109\/cog52621.2021.9619044","type":"proceedings-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T20:53:06Z","timestamp":1638910386000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["A New Challenge: Approaching Tetris Link with AI"],"prefix":"10.1109","author":[{"given":"Matthias","family":"Muller-Brockhausen","sequence":"first","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden University,The Netherlands"}]},{"given":"Mike","family":"Preuss","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden University,The Netherlands"}]},{"given":"Aske","family":"Plaat","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Leiden University,The Netherlands"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Prox-imal policy optimization algorithms","author":"schulman","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref38","author":"hill","year":"2018","journal-title":"Stable Baselines"},{"key":"ref33","first-page":"282","article-title":"Bandit based monte-carlo planning","author":"kocsis","year":"0","journal-title":"European Conference on Machine Learning"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1985.tb00058.x"},{"key":"ref30","first-page":"16","article-title":"Is the first move an advantage","author":"streeter","year":"1946","journal-title":"Chess Review"},{"key":"ref37","article-title":"OpenAI Gym","author":"brockman","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1613\/jair.301"},{"key":"ref35","first-page":"14","article-title":"A lock-free multithreaded Monte-Carlo tree search algorithm","author":"enzenberger","year":"2009","journal-title":"Advances in Computer Games"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17928-0_6"},{"key":"ref10","article-title":"Blokus Game Solver","author":"chao","year":"2018","journal-title":"Computer and Communication Engineering"},{"key":"ref40","first-page":"540","article-title":"Lessons in neural network training: Overfitting may be harder than expected","author":"lawrence","year":"1997","journal-title":"AAAI\/IAAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CADS.2013.6714256"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2014.7082823"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-59238-7","author":"plaat","year":"2020","journal-title":"Learning to Play Reinforcement Learning and Games"},{"key":"ref14","author":"van rijswijck","year":"2002","journal-title":"Search and evaluation in Hex"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00165-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00126-3"},{"key":"ref17","author":"russell","year":"2016","journal-title":"Artificial Intelligence A Modern Approach"},{"key":"ref18","first-page":"72","article-title":"Efficient selectivity and backup operators in Monte-Carlo tree search","author":"coulom","year":"0","journal-title":"International conference on computers and games"},{"key":"ref19","article-title":"Combining simulated annealing and Monte Carlo tree search for expression simplification","author":"ruijl","year":"2013","journal-title":"ArXiv Preprint"},{"key":"ref28","first-page":"637","article-title":"Programming a computer for playing chess","author":"shannon","year":"1949","journal-title":"first presented at the National IRE Convention March 9 1949 and also in Claude Elwood Shannon Collected Papers"},{"key":"ref4","first-page":"153","article-title":"Computer chess, then and now: The Deep Blue saga","author":"hsu","year":"0","journal-title":"Proceedings of Technical Papers International Symposium on VLSI Technology Systems and Applications"},{"key":"ref27","first-page":"299","article-title":"The branching factor of regular search spaces","author":"edelkamp","year":"1998","journal-title":"AAAI\/IAAI"},{"key":"ref3","author":"bradford","year":"1826","journal-title":"The History and Analysis of the Supposed Automation Chess Player of M de Kempelen Now Exhibiting in this Country by Mr Maelzel"},{"key":"ref6","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":"ref29","first-page":"103","article-title":"Chess, Shogi, Go, natural developments in game research","volume":"19","author":"matsubara","year":"1996","journal-title":"ICCA Journal"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"484","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref7","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0013091500030522"},{"key":"ref1","first-page":"1790","article-title":"Analysis of the Game of Chess","author":"philidor","year":"0","journal-title":"P Elrnsly"},{"key":"ref9","article-title":"Does experiential learning improve learning outcomes in an undergraduate course in game theory-a preliminary analysis","author":"orenstein","year":"2014","journal-title":"Northeast Decision Sciences Institute"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref20","article-title":"Neurogammon: A neural network backgammon learning program","author":"tesauro","year":"1989","journal-title":"Heuristic Programming in Artificial Intelligence The First Computer Olympiad Chichester England"},{"key":"ref45","article-title":"Hyper state space graphs for automated game analysis","author":"cook","year":"0","journal-title":"2019 IEEE Conference on Games (COG)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IISA.2014.6878747"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2017.2785042"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.10.004"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1724-z"},{"key":"ref24","year":"2019"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/IS.2008.4670492"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-007-0713-4"},{"key":"ref44","first-page":"21","article-title":"Rating the chess rating system","volume":"12","author":"glickman","year":"1999","journal-title":"CHANCE-BERLIN THEN NEW YORK-"},{"key":"ref26","article-title":"Applying reinforcement learning to Tetris","author":"carr","year":"2005","journal-title":"Computer Science Department Rhodes University"},{"key":"ref43","first-page":"267","article-title":"A Bayesian Approximation Method for Online Ranking","volume":"12","author":"weng","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/3619195"}],"event":{"name":"2021 IEEE Conference on Games (CoG)","location":"Copenhagen, Denmark","start":{"date-parts":[[2021,8,17]]},"end":{"date-parts":[[2021,8,20]]}},"container-title":["2021 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9618888\/9618891\/09619044.pdf?arnumber=9619044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:14:11Z","timestamp":1659485651000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9619044\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/cog52621.2021.9619044","relation":{},"subject":[],"published":{"date-parts":[[2021,8,17]]}}}