跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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.

查看此版本解读 →查看此版本原文 ↗