Monte Carlo Tree Search Experiments in Hearthstone

André Santos, Pedro A. Santos, Francisco S. Melo

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

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.
Original languageEnglish
Title of host publication2017 IEEE Conference on Computational Intelligence and Games (CIG)
Place of PublicationNew York, NY
PublisherIEEE
Pages272-279
ISBN (Electronic)978-1-5386-3233-8
DOIs
Publication statusPublished - 2017
Externally publishedYes
Event2017 Conference on Computational Intelligence in Games - New York University, New York, United States
Duration: 22 Aug 201725 Aug 2017
http://www.cig2017.com/

Conference

Conference2017 Conference on Computational Intelligence in Games
Abbreviated titleCiG2017
CountryUnited States
CityNew York
Period22/08/1725/08/17
Internet address

    Fingerprint

Keywords

  • Monte Carlo Tree Search
  • Artificial intelligence for games
  • Hearthstone

Cite this

Santos, A., Santos, P. A., & Melo, F. S. (2017). Monte Carlo Tree Search Experiments in Hearthstone. In 2017 IEEE Conference on Computational Intelligence and Games (CIG) (pp. 272-279). New York, NY: IEEE. https://doi.org/10.1109/CIG.2017.8080446