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.

翻译：本文中，我们将无界极小化极大算法（Unbounded Minimax）——零和双人完美信息博弈中最先进的搜索算法——推广至多人完美信息博弈框架。实验证明，该推广算法在性能上也优于主要的多玩家搜索算法。