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.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.