AI Agents 相关度: 8/10

Minibal: Balanced Game-Playing Without Opponent Modeling

Quentin Cohen-Solal, Tristan Cazenave
arXiv: 2603.23059v1 发布: 2026-03-24 更新: 2026-03-24

AI 摘要

Minibal通过改进Minimax算法,旨在实现游戏AI的平衡对战,提高人机交互的趣味性和教育价值。

主要贡献

  • 提出了Minibal算法,一种Minimax的变体
  • 针对平衡策略,改进了Unbounded Minimax算法
  • 实验验证了Minibal在多种棋盘游戏中能实现平衡对战

方法论

通过修改Minimax算法,引入平衡的概念,并通过实验验证改进后的算法在多个游戏中的效果。

原文摘要

Recent advances in game AI, such as AlphaZero and Athénan, have achieved superhuman performance across a wide range of board games. While highly powerful, these agents are ill-suited for human-AI interaction, as they consistently overwhelm human players, offering little enjoyment and limited educational value. This paper addresses the problem of balanced play, in which an agent challenges its opponent without either dominating or conceding. We introduce Minibal (Minimize & Balance), a variant of Minimax specifically designed for balanced play. Building on this concept, we propose several modifications of the Unbounded Minimax algorithm explicitly aimed at discovering balanced strategies. Experiments conducted across seven board games demonstrate that one variant consistently achieves the most balanced play, with average outcomes close to perfect balance. These results establish Minibal as a promising foundation for designing AI agents that are both challenging and engaging, suitable for both entertainment and serious games.

标签

游戏AI 平衡对战 Minimax 人机交互

arXiv 分类

cs.AI