pith. sign in

arxiv: 1808.04794 · v1 · pith:URGVWKKFnew · submitted 2018-08-14 · 💻 cs.AI · cs.LG

Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithms

classification 💻 cs.AI cs.LG
keywords gamehearthstonemctssearchsupervisedagentagentsalgorithm
0
0 comments X
read the original abstract

We investigate the impact of supervised prediction models on the strength and efficiency of artificial agents that use the Monte-Carlo Tree Search (MCTS) algorithm to play a popular video game Hearthstone: Heroes of Warcraft. We overview our custom implementation of the MCTS that is well-suited for games with partially hidden information and random effects. We also describe experiments which we designed to quantify the performance of our Hearthstone agent's decision making. We show that even simple neural networks can be trained and successfully used for the evaluation of game states. Moreover, we demonstrate that by providing a guidance to the game state search heuristic, it is possible to substantially improve the win rate, and at the same time reduce the required computations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Many AI Challenges of Hearthstone

    cs.AI 2019-07 unverdicted novelty 3.0

    The paper surveys AI challenges in Hearthstone to illustrate the broader field of AI and games research through in-depth analysis of a single game.