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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper, Monte Carlo tree search (MCTS) is introduced for controlling the Pac-Man character in the real-time game Ms Pac… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Monte-Carlo Tree Search (MCTS) is a state-of-the-art stochastic search algorithm that has successfully been applied to various… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Review
2012
Review
2012
Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2011
2011
We propose an algorithm for computing approximate Nash equilibria of partially observable games using Monte-Carlo tree search… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Monte Carlo tree search (MCTS) methods have had recent success in games, planning, and optimization. MCTS uses results from… (More)
  • figure 2
  • table 1
  • figure 3
  • figure 5
  • table 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… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… (More)
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Two-person zero-sum games with perfect information have been addressed by many AI researchers with great success for fifty years… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?