Single-Player Monte-Carlo Tree Search

@inproceedings{Schadd2008SinglePlayerMT,
  title={Single-Player Monte-Carlo Tree Search},
  author={Maarten P. D. Schadd and Mark H. M. Winands and H. Jaap van den Herik and Guillaume Chaslot and Jos W. H. M. Uiterwijk},
  booktitle={Computers and Games},
  year={2008}
}
Classical methods such as A* and IDA* are a popular and successful choice for one-player games. However, they fail without an accurate admissible evaluation function. In this paper we investigate whether Monte-Carlo Tree Search (MCTS) is an interesting alternative for one-player games where A* and IDA* methods do not perform well. Therefore, we propose a new MCTS variant, called Single-Player Monte-Carlo Tree Search (SP-MCTS). The selection and backpropagation strategy in SP-MCTS are different… CONTINUE READING

8 Figures & Tables

Topics

Statistics

0510152009201020112012201320142015201620172018
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.