跳到正文
arXiv cs.AI· Yiyu Qian, Tim Miller, Liyuan Zhao·· 4 小时前AI 评分18

用过程挖掘解释多智能体 MCTS-minimax 混合博弈策略:3v3 跳棋研究

Exploring Explainable Multi-agent MCTS-minimax Hybrids in Board Game Using Process Mining

AI 导读

研究将浅层 minimax 搜索融入多智能体 MCTS 的 rollout 阶段,并用过程挖掘技术解释智能体在 3v3 跳棋中的策略。该工作针对 MCTS 构建高选择性搜索树、可能漏掉关键走法并落入战术陷阱的弱点,以全宽 minimax 搜索作为补充方案。论文共 38 页,属于 AAAI 2025 PRL。

正文 · 原文

View PDF HTML (experimental)

Abstract:Monte-Carlo Tree Search (MCTS) is a family of sampling-based search algorithms widely used for online planning in sequential decision-making domains and at the heart of many recent advances in artificial intelligence. Understanding the behavior of MCTS agents is difficult for developers and users due to the frequently large and complex search trees that result from the simulation of many possible futures, their evaluations, and their relationships. This paper presents our ongoing investigation into potential explanations for the decision-making and behavior of MCTS. A weakness of MCTS is that it constructs a highly selective tree and, as a result, can miss crucial moves and fall into tactical traps. Full-width minimax search constitutes the solution. We integrate shallow minimax search into the rollout phase of multi-agent MCTS and use process mining technique to explain agents' strategies in 3v3 checkers.
Comments: 38 pages, AAAI 2025 PRL
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2503.23326 [cs.AI]
  (or arXiv:2503.23326v4 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2503.23326

arXiv-issued DOI via DataCite

Submission history

From: Yiyu Qian [view email]
[v1] Sun, 30 Mar 2025 05:48:53 UTC (37,832 KB)
[v2] Tue, 20 May 2025 14:09:58 UTC (37,874 KB)
[v3] Wed, 24 Sep 2025 14:08:00 UTC (17,622 KB)
[v4] Tue, 17 Nov 2026 06:47:02 UTC (17,614 KB)

来源:arXiv cs.AI · arxiv.org