arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.15895cs.GT
收藏

菜o已解决

Quixo Is Solved

Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura

摘要:

菜o是一个双人游戏,在5 $\times$ 5网格上玩,玩家试图将五个相同的符号对齐。游戏的细节需要使用新颖的技术。使用价值迭代和逆向归纳相结合,我们提出了第一个完整的分析游戏。我们描述了内存高效的数据结构和算法优化,使游戏在合理的时间和空间限制内解决。我们的主要结论是,菜o是一个平局游戏。本文还包含了较小的电路板的分析,并提出了一些有趣的状态提取我们的计算。

英文摘要:

Quixo is a two-player game played on a 5$\times$5 grid where the players try to align five identical symbols. Specifics of the game require the usage of novel techniques. Using a combination of value iteration and backward induction, we propose the first complete analysis of the game. We describe memory-efficient data structures and algorithmic optimizations that make the game solvable within reasonable time and space constraints. Our main conclusion is that Quixo is a Draw game. The paper also contains the analysis of smaller boards and presents some interesting states extracted from our computations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑