The MP-MIX Algorithm: Dynamic Search Strategy Selection in Multiplayer Adversarial Search

When constructing a search tree for multiplayer games, there are two basic approaches to propagating the opponents´ moves. The first approach, which stems from the MaxN algorithm, assumes each opponent will follow his highest valued heuristic move. In the second approach, the paranoid algorithm, the player prepares for the worst case by assuming the opponents will select the worst move with respect to him. There is no definite answer as to which approach is better, and their main shortcoming is that their strategy is fixed. We therefore suggest the MaxN-paranoid mixture (MP-Mix) algorithm: a multiplayer adversarial search that switches search strategies according to the game situation. The MP-mix algorithm examines the current situation and decides whether the root player should follow the MaxN principle, the paranoid principle, or the newly presented directed offensive principle. To evaluate our new algorithm, we performed extensive experimental evaluation on three multiplayer domains: Hearts, Risk, and Quoridor. In addition, we also introduce the opponent impact (OI) measure, which measures the players´ ability to impede their opponents´ efforts, and show its relation to the relative performance of the MP-mix strategy. The results show that our MP-mix strategy significantly outperforms MaxN and paranoid in various settings in all three games.