cs.AIMar 30, 2025

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

Authors: Yiyu Qian, Tim Miller, Liyuan Zhao

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.

Figures & tables

Appendix figures & tables54 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. M2-PALE: A Framework for Explaining Multi-Agent MCTS--Minimax Hybrids via Process Mining and LLMs

    Apr 16, 2026Yiyu Qian, Liyuan Zhao, Tim MillerExplainable Artificial IntelligenceGame-Playing Agents

  2. Toward Template-Free Explainability for Monte Carlo Tree Search

    May 15, 2026Siqi Lu, Mirsaleh Bahavarnia, Hiba Baroud +3Natural Language Explanation GenerationExplainable Artificial Intelligence

  3. NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search

    May 1, 2026Sizhe Tang, Zuyuan Zhang, Mahdi Imani +1Multi-Agent System OptimizationMulti-Agent Coordination