Study and Improvement of Search Algorithms in Stochastic Perfect-Information

arXiv:2611.24486v1 Announce Type: new
Abstract: 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.
This article has been indexed from cs.AI updates on arXiv.org

Read the original article:

Study and Improvement of Search Algorithms in Stochastic Perfect-Information