Classification of Monte Carlo Tree Search Variants

\Many variations of Monte Carlo tree search have been proposed and tested but relatively little comparison of these variants have occurred. In this study an Agent Case Embedding analysis and agglomorative hierarchical clustering was performed using eight variants of Monte Carlo Tree Search as agents and eight games as cases. This allowed us to compare the variant's abilities on each of the games to determine the type of games each are good at handling as well as which variants are similar to others. This comparison of variants exploits the ability of ACEs to compare different types of objects based on their behavior. By looking at the behavior of MCTS variants on a variety of games we obtain a good notion of the degree to which different MCTS variants exhibit different capabilities. A side effect of comparing MCTS variants with agent-case embeddings is that we also are able to compare the games used to test the MCTS variants.