Monte Carlo Tree Search Experiments in Hearthstone
In: info:eu-repo/grantAgreement/EC/H2020/644187/EU/Realising an Applied Gaming Eco-system/RAGE
In this paper, we introduce a Monte-Carlo tree search (MCTS) approach for the game "Hearthstone: Heroes of Warcraft". We argue that, in light of the challenges posed by the game (such as uncertainty and hidden information), Monte Carlo tree search offers an appealing alternative to existing AI players. Additionally, by enriching MCTS with a properly constructed heuristic, it is possible to introduce significant gains in performance.We illustrate through extensive empirical validation the superior performance of our approach against vanilla MCTS and the current state-of-the art AI for Hearthstone. ; This study is part of the RAGE project. The RAGE project has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 644187. This publication reflects only the author's view. The European Commission is not responsible for any use that may be made of the information it contains.