跳到正文
arXiv cs.AI· Quentin Cohen-Solal, Tristan Cazenave·· 1 小时前AI 评分33

随机完美信息博弈中的搜索算法研究与改进:Unbounded Minimax 的随机化推广

Study and Improvement of Search Algorithms in Stochastic Perfect-Information

AI 导读

一项 arXiv 研究将确定性零和双人完美信息博弈中的最先进搜索算法 Unbounded Minimax 推广到随机零和双人完美信息博弈框架。实验表明,该推广算法的性能优于主流随机搜索算法。

正文 · 原文

View PDF HTML (experimental)

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.
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2611.24486 [cs.AI]
  (or arXiv:2611.24486v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2611.24486

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Quentin Cohen-Solal [view email]
[v1] Wed, 18 Nov 2026 14:20:11 UTC (347 KB)

来源:arXiv cs.AI · arxiv.org