@inbook{81c51ea74817447c95c3a786bc014e4b,
title = "Single-Player Monte-Carlo Tree Search",
abstract = "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 from standard mcts. Moreover, sp-mcts makes use of a straightforward meta-search extension. We tested the method on the puzzle samegame. It turned out that our sp-mcts program gained the highest score so far on the standardized test set.",
author = "Schadd, {Maarten P. D.} and Winands, {Mark H. M.} and {van den Herik}, {H. Jaap} and Chaslot, {Guillaume M. J. -B.} and Uiterwijk, {Jos W. H. M.}",
year = "2008",
doi = "10.1007/978-3-540-87608-3_1",
language = "English",
isbn = "978-3-540-87608-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "1--12",
booktitle = "Computers and Games",
address = "United States",
}