Monte-Carlo Tree Search for Fox Game

Sammanfattning: This report explores if Monte-Carlo Tree Search (MCTS) can perform well in Fox Game, a classic Scandinavian strategy game. MCTS is implemented using a cutoff in the simulation phase. The game state is then evaluated using a heuristic function that is formulated using theoretical arguments from its chess counterpart. MCTS is shown to perform on the same level as highly experienced human players using limited computational resources. The method is used to explore how the imbalance in Fox Game (favoring sheep) can be mended by reducing the number of sheep pieces from 20 to 18.