Please use this identifier to cite or link to this item:
|Title:||Monte Carlo Tree Search Experiments in Hearthstone|
Santos, Pedro A.
Melo, Francisco S.
|Keywords:||Monte Carlo Tree Search|
Artificial intelligence for games
|Citation:||André Santos, Pedro A. Santos, Francisco S. Melo: “Monte Carlo Tree Search Experiments in Hearthstone”, CiG 2017, New York, USA, IEEE Computer Society, 2017|
|Abstract:||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.|
|Appears in Collections:||1. RAGE Publications|
Files in This Item:
|2017-SantosSantosMelo_CIG2017 (1).pdf||518.72 kB||Adobe PDF||View/Open|
This item is licensed under a Creative Commons License