{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:40:31Z","timestamp":1766137231280,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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,6]]},"DOI":"10.1109\/cec.2019.8790141","type":"proceedings-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:07Z","timestamp":1565308807000},"page":"450-457","source":"Crossref","is-referenced-by-count":8,"title":["Biasing MCTS with Features for General Games"],"prefix":"10.1109","author":[{"given":"Dennis J. N. J.","family":"Soemers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Piette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron","family":"Browne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"83","article-title":"What’s a ludeme?","volume":"2","author":"parlett","year":"2016","journal-title":"Game & Puzzle Design"},{"key":"ref11","first-page":"62","article-title":"General game playing: Overview of the AAAI competition","volume":"26","author":"genesereth","year":"2005","journal-title":"AI Magazine"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-010-0081-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22887-2_38"},{"key":"ref14","first-page":"127","article-title":"Distance features for general game playing agents","author":"michulke","year":"2012","journal-title":"Proc 4th Int Conf Agents Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36907-0_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2013.2286825"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00157-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273531"},{"key":"ref4","first-page":"2284","article-title":"Feedback-based tree search for reinforcement learning","volume":"80","author":"jiang","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn Proc Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar6404"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref8","first-page":"70","article-title":"Strategic features for general games","author":"browne","year":"2019","journal-title":"Proc 2nd Workshop on Knowledge Extraction from Games (KEG)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref2","first-page":"5360","article-title":"Thinking fast and slow with deep learning and tree search","author":"anthony","year":"2017","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490420"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-75538-8_11","article-title":"Feature construction for reinforcement learning in Hearts","volume":"4630","author":"sturtevant","year":"2007","journal-title":"Computers and Games"},{"key":"ref22","article-title":"Automated¨ discovery of search-extension features","volume":"6048","author":"skowronski","year":"2009","journal-title":"Proc Adv Comput Games"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71649-7_12"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.024"},{"key":"ref23","article-title":"Correlation-based feature selection for machine learning","author":"hall","year":"1999","journal-title":"Ph D Dissertation"}],"event":{"name":"2019 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2019,6,10]]},"location":"Wellington, New Zealand","end":{"date-parts":[[2019,6,13]]}},"container-title":["2019 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8778428\/8789744\/08790141.pdf?arnumber=8790141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:11:31Z","timestamp":1658157091000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8790141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cec.2019.8790141","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}