Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games

TL;DR

This paper extends the Unbounded Minimax algorithm to multiplayer perfect-information games and demonstrates its superior performance over existing algorithms through experiments.

Contribution

The paper introduces a generalized version of Unbounded Minimax for multiplayer games and shows it outperforms current main algorithms.

Findings

Generalized Unbounded Minimax improves search efficiency in multiplayer games.

Experimental results show better performance than existing multiplayer search algorithms.

The approach is applicable to a broad class of multiplayer perfect-information games.

Abstract

In this article, we generalize Unbounded Minimax, the state-of-the-art search algorithm for zero sums two-player games with perfect information to the framework of multiplayer games with perfect information. We experimentally show that this generalized algorithm also achieves better performance than the main multiplayer search algorithms.