← 研踪 PaperTrailarXiv:2611.24486 · v1
Study and Improvement of Search Algorithms in Stochastic Perfect-Information
首次提交 2026-11-18 22:20
版本更新 2026-11-18 22:20
雷达观测 2026-11-19 15:04
摘要
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.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 22:20 · 最新观测版本
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.
查看此版本解读 →查看此版本原文 ↗