Optimizing Hearthstone agents using an evolutionary algorithm

作者:

Highlights:

摘要

Digital collectible card games are not only a growing part of the video game industry, but also an interesting research area for the field of computational intelligence. This game genre allows researchers to deal with hidden information, uncertainty and planning, among other aspects. This paper proposes the use of evolutionary algorithms (EAs) to develop agents who play a card game, Hearthstone, by optimizing a data-driven decision-making mechanism that takes into account all the elements currently in play. Agents feature self-learning by means of a competitive coevolutionary training approach, whereby no external sparring element defined by the user is required for the optimization process. One of the agents developed through the proposed approach was runner-up (best 6%) in an international Hearthstone Artificial Intelligence (AI) competition. Our proposal performed remarkably well, even when it faced state-of-the-art techniques that attempted to take into account future game states, such as Monte-Carlo Tree search. This outcome shows how evolutionary computation could represent a considerable advantage in developing AIs for collectible card games such as Hearthstone.

论文关键词:Evolutionary algorithms,Hearthstone,Videogames,Evolution strategy,Artificial intelligence,Games,Card games,Collectible card games

论文评审过程:Received 5 July 2019, Revised 30 August 2019, Accepted 7 September 2019, Available online 20 September 2019, Version of Record 20 January 2020.

论文官网地址:https://doi.org/10.1016/j.knosys.2019.105032