This paper presents a preliminary study using Monte Carlo Tree Search (MCTS) upon the board game of Quoridor. Quoridor is an interesting game for expansion of player agents in MCTS due to having a mechanically simple rule set, however, Quoridor has a state-space complexity similar to Chess with a higher game-tree complexity. The system is shown to perform well against current existing methods, defeating a set of player agents drawn from an existing digital implementation as well as a previous method using a GA.
Full Paper available: https://www.researchgate.net/publication/327679826_Monte_Carlo_Tree_Search_for_Quoridor
For executing the code in Java please run Main.java to play against the algorithm.