2021
DOI: 10.48550/arxiv.2103.04931
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Monte Carlo Tree Search: A Review of Recent Modifications and Applications

Maciej Świechowski,
Konrad Godlewski,
Bartosz Sawicki
et al.

Abstract: Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-playing bots or solving sequential decision problems. The method relies on intelligent tree search that balances exploration and exploitation. MCTS performs random sampling in the form of simulations and stores statistics of actions to make more educated choices in each subsequent iteration. The method has become a state-ofthe-art technique for combinatorial games, however, in more complex games (e.g. those with high branching factor or re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
2
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 132 publications
(149 reference statements)
0
7
0
Order By: Relevance
“…Monte Carlo Tree Search (MCTS) is a stochastic, anytime, asymmetric, knowledge-free search algorithm popular in a wide range of games and non-games problems (Browne et al, 2012;Świechowski et al, 2021). It has been especially successful in the domains of computer Go (Silver et al, 2016) and various challenges of General Game Playing (Perez-Liebana et al, 2019b;Finnsson and Björnsson, 2010).…”
Section: Monte Carlo Tree Searchmentioning
confidence: 99%
“…Monte Carlo Tree Search (MCTS) is a stochastic, anytime, asymmetric, knowledge-free search algorithm popular in a wide range of games and non-games problems (Browne et al, 2012;Świechowski et al, 2021). It has been especially successful in the domains of computer Go (Silver et al, 2016) and various challenges of General Game Playing (Perez-Liebana et al, 2019b;Finnsson and Björnsson, 2010).…”
Section: Monte Carlo Tree Searchmentioning
confidence: 99%
“…The plan relies on a smart tree search that balances exploration and exploitation. Random sampling is employed in MCTS in the form of simulations to save statistics of activities and make more knowledgeable selections in each future iteration [72]. MCTS is a decision-making technique that is utilized in scanning huge combinatorial spaces represented by trees.…”
Section: B Monte Carlo Tree Searchmentioning
confidence: 99%
“…MCTS is a decision-making technique that is utilized in scanning huge combinatorial spaces represented by trees. In such trees, nodes represent states, also referred to as con gurations of the problem, whereas edges denote transitions (actions) between states [72].…”
Section: B Monte Carlo Tree Searchmentioning
confidence: 99%
“…They are DESs with larger branching factors, which results that agents usually have not sufficient time to make decisions. One of the main bottlenecks of algorithms in such complex environments is that search spaces are too huge [1].…”
Section: Introductionmentioning
confidence: 99%