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 . This paper discusses the steps of the MCTS algorithm, its application to the board.
"Monte Carlo Tree Search and Its Applications,"
Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal: Vol. 2:
2, Article 4.
Available at: https://digitalcommons.morris.umn.edu/horizons/vol2/iss2/4