{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:37:56Z","timestamp":1779359876586,"version":"3.51.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Games"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/tciaig.2017.2738156","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T18:44:14Z","timestamp":1502390654000},"page":"281-291","source":"Crossref","is-referenced-by-count":16,"title":["Playing Multiaction Adversarial Games: Online Evolutionary Planning Versus Tree Search"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5381-5498","authenticated-orcid":false,"given":"Niels","family":"Justesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Mahlmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Risi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3128-4598","authenticated-orcid":false,"given":"Julian","family":"Togelius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.1.1"},{"key":"ref38","article-title":"Methods of MCTS and the game Arimaa","author":"kozelek","year":"2009","journal-title":"master's thesis Faculty Math Phys Charles Univ Prague Czech Republic"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.856210"},{"key":"ref32","first-page":"187","article-title":"Continual online evolution for in-game build order adaptation in StarCraft","author":"justesen","year":"0","journal-title":"Proc Genetic Evol Comput Conf"},{"key":"ref31","first-page":"114","article-title":"Portfolio online evolution in StarCraft","author":"wang","year":"0","journal-title":"Proc 1st Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref30","first-page":"819","article-title":"Genetically breeding populations of computer programs to solve problems in artificial intelligence","author":"koza","year":"0","journal-title":"Proc 2nd Int IEEE Conf Tools Artificial Intell"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.11.014"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2210424"},{"key":"ref35","first-page":"120","article-title":"A phantom-go program","author":"cazenave","year":"2005","journal-title":"Advances in Computer Games"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","article-title":"XXII. programming a computer for playing chess","volume":"41","author":"shannon","year":"1950","journal-title":"London Edinburgh Dublin Philosoph Mag J Sci"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-3-642-29178-4_26","article-title":"Monte-Carlo tree search for the physical travelling salesman problem","author":"perez","year":"2012","journal-title":"Applications of Evolutionary Computation"},{"key":"ref40","first-page":"174","article-title":"Rolling horizon coevolutionary planning for two-player video games","author":"liu","year":"0","journal-title":"Proc 8th Comput Sci Electron Eng"},{"key":"ref11","first-page":"418","article-title":"Analysis of vanilla rolling horizon evolution parameters in general video game playing","author":"gaina","year":"0","journal-title":"Proc Eur Conf Appl Evol Comput"},{"key":"ref12","first-page":"77","article-title":"General video game playing","volume":"6","author":"levine","year":"2013","journal-title":"Artificial and Computational Intelligence in Games"},{"key":"ref13","first-page":"216","article-title":"Monte-carlo tree search: A new framework for game AI","author":"chaslot","year":"0","journal-title":"Proc Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref15","first-page":"590","article-title":"Online evolution for multi-action adversarial games","author":"justesen","year":"0","journal-title":"Proc Eur Conf Appl Evol Comput"},{"key":"ref16","first-page":"72","article-title":"Efficient selectivity and backup operators in monte-carlo tree search","author":"coulom","year":"0","journal-title":"Proc 5th Int Conf Comput Games"},{"key":"ref17","first-page":"2404","article-title":"Non-linear monte-carlo search in Civilization II","author":"branavan","year":"0","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2204883"},{"key":"ref19","first-page":"21","article-title":"Monte-Carlo tree search in Settlers of Catan","author":"szita","year":"0","journal-title":"Proc 12th Adv Comput Games Conf"},{"key":"ref28","first-page":"1238","article-title":"Almost optimal exploration in multi-armed bandits","author":"karnin","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref4","first-page":"58","article-title":"The combinatorial multi-armed bandit problem and its application to real-time strategy games","author":"ontan\u00f3n","year":"0","journal-title":"Proc Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref27","first-page":"104","article-title":"Move-pruning techniques for Monte-Carlo go","author":"bouzy","year":"2005","journal-title":"Advances in Computer Games"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00127-8"},{"key":"ref6","first-page":"156","article-title":"Super Mario evolution","author":"togelius","year":"0","journal-title":"Proc IEEE Symp Comput Intell Games"},{"key":"ref29","first-page":"234","article-title":"Monte Carlo tree search with macro-actions and heuristic route planning for the physical travelling salesman problem","author":"powley","year":"0","journal-title":"Proc IEEE Conf Comput Intell Games"},{"key":"ref5","first-page":"351","article-title":"Rolling horizon evolution versus tree search for navigation in single-player real-time games","author":"perez","year":"0","journal-title":"Proc 15th Annu Conf Genetic Evol Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2494596"},{"key":"ref7","first-page":"1179","article-title":"Evolving competitive car controllers for racing games with neuroevolution","author":"cardamone","year":"0","journal-title":"Proc 11th Annu Conf Genetic Evol Comput"},{"key":"ref2","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.1597057"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448847"},{"key":"ref20","first-page":"323","article-title":"Grid coevolution for adaptive simulations: Application to the building of opening books in the game of go","author":"audouard","year":"0","journal-title":"Proc Workshops Appl Evol Comput"},{"key":"ref22","first-page":"605","article-title":"All-moves-as-first heuristics in Monte-Carlo go","author":"helmbold","year":"0","journal-title":"Proc Int Conf Artif Intell"},{"key":"ref21","article-title":"Exploration exploitation in go: UCT for Monte-Carlo go","author":"gelly","year":"0","journal-title":"Proc Neural Inf Process Syst Conf On-line Trading Exploration Exploitation Workshop"},{"key":"ref42","author":"glover","year":"2013","journal-title":"Tabu Search*"},{"key":"ref24","first-page":"16","article-title":"Hierarchical portfolio search: Prismatas robust AI architecture for games with large search spaces","author":"churchill","year":"0","journal-title":"Proc Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref41","article-title":"Niching methods for genetic algorithms","author":"mahfoud","year":"1995"},{"key":"ref23","first-page":"1","article-title":"Portfolio greedy search and simulation for large-scale combat in StarCraft","author":"churchill","year":"0","journal-title":"Proc IEEE Conf Comput Intell Games"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1142\/S1793005708001094"},{"key":"ref25","first-page":"1","article-title":"Script-and cluster-based UCT for StarCraft","author":"justesen","year":"0","journal-title":"Proc IEEE Conf Comput Intell Games"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/8464709\/08007320.pdf?arnumber=8007320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T08:47:50Z","timestamp":1643186870000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8007320\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":42,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2017.2738156","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"value":"2475-1502","type":"print"},{"value":"2475-1510","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}