Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
M2-PALE: A Framework for Explaining Multi-Agent MCTS--Minimax Hybrids via Process Mining and LLMs
Yiyu Qian, Liyuan Zhao, Tim Miller
Monte-Carlo Tree Search (MCTS) is a fundamental sampling-based search algorithm widely used for online planning in sequential decision-making domains. Despite its success in drivin…
cs.AI2025
Exploring Explainable Multi-agent MCTS-minimax Hybrids in Board Game Using Process Mining
Yiyu Qian, Tim Miller, Zheng Qian +1
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…