Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Monte Carlo tree search

Known as: MCTS, Monte Carlo tree, Monte-Carlo tree search 
In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Monte Carlo tree search (MCTS) is an AI technique that has been successfully applied to many deterministic games of perfect… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Classic methods such as A^* and IDA^* are a popular and successful choice for one-player games. However, without an accurate… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper introduces a Monte-Carlo algorithm for online planning in large POMDPs. The algorithm combines a Monte-Carlo update of… Expand
  • figure 1
  • table 1
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of AI… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Games are considered important benchmark opportunities for artificial intelligence research. Modern strategic board games can… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Monte-Carlo Tree Search (MCTS) is a new best-first search guided by the results of Monte-Carlo simulations. In this article, we… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Classical methods such as A* and IDA* are a popular and successful choice for one-player games. However, they fail without an… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI… Expand
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations. The method… Expand
  • table 1
  • figure 1
  • table 2
Is this relevant?