Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games
arXiv:2604.1737825.0h-index: 6
Predicted impact top 45% in GT · last 90 daysOriginality Synthesis-oriented
AI Analysis
For AI researchers working on game-playing agents, this provides a more efficient search algorithm for multiplayer games.
The paper generalizes Unbounded Minimax to multiplayer perfect-information games and shows experimentally that it outperforms existing multiplayer search algorithms.
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.