This source only provides a headline — there is no body to show. Use “Read the original” below to read it at the source.
Study and Improvement of Search Algorithms in Stochastic Perfect-Information
Summary
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.
Published by arXiv cs.AI
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.