Monte Carlo Tree Search and Its Applications

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 do-mains with vast search spaces which historically have chal-lenged deterministic algorithms [3]. This paper discusses the steps of the MCTS algorithm, its application to the board game Go, and its application to narrative generation.