Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal
Document Type
Article
Abstract
Monte Carlo tree search (MCTS) is a probabilistic algorithm that uses lightweight random simulations to selectively grow a game tree. MCTS has experienced a lot of success in domains with vast search spaces which historically have challenged deterministic algorithms [3]. This paper discusses the steps of the MCTS algorithm, its application to the board.
Recommended Citation
Magnuson, Max
(2015)
"Monte Carlo Tree Search and Its Applications,"
Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal: Vol. 2:
Iss.
2, Article 4.
DOI: https://doi.org/10.61366/2576-2176.1028
Available at:
https://digitalcommons.morris.umn.edu/horizons/vol2/iss2/4
Primo Type
Article
COinS