Study and Improvement of Search Algorithms in Stochastic Perfect-Information
In this article, we generalize Unbounded Minimax, the state- of-the-art search algorithm for deterministic zero-sum two- player games with perfect information to the framework of stochastic zero-sum two-player games with perfect informa- tion. We experimentally show that this generalized algorithm achieves better performance than the main stochastic search algorithms.
Authors
- Tristan Cazenave (ORCID: https://orcid.org/0000-0003-4669-9374)
- Quentin Cohen-Solal (ORCID: https://orcid.org/0000-0003-4828-2708)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24486
- Primary Topic
- Artificial Intelligence in Games
- Type
- preprint