Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
One of the most important tasks of artificial intelligence is to create a universal intelligent agent, which can succeed in… 
2019
2019
Monte Carlo Tree Search (MCTS) is a best-first search which is efficient in large search spaces and is effective at balancing… 
2015
2015
—This paper considers object recognition with a camera, whose viewpoint can be controlled in order to improve the recognition… 
2014
2014
Process parallelization is more important than ever, as most modern hardware contains multiple processors and advanced multi… 
Review
2014
Review
2014
Monte Carlo Tree Search (MCTS) is currently the most popular game playing algorithm for perfect-information extensive-form games… 
Review
2013
Review
2013
Abstract : In this project examine applications of Monte Carlo tree search, an artificial intelligence algorithm, in military… 
2012
2012
In this paper enhancements for the Monte-Carlo Tree Search (MCTS) framework are investigated to play Ms Pac-Man. MCTS is used to… 
2010
2010
Monte-Carlo tree search is a new best-first tree search algorithm that triggered a revolution in the computer Go world… 
2010
2010
Monte Carlo Tree Search is a method of finding near-optimal solutions for large state-space problems. Currently, is it very… 
2007
2007
Monte-Carlo Tree Search is a new method which has been applied successfully to many games. However, it has never been tested on…