Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal


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.