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

表复杂度的一个上界

An Upper Bound on the Complexity of Tablut

Andrea Galassi

摘要:

Tablut是一个完全知识的、确定性的、非对称的棋盘游戏,目前还没有得到解决和适当的研究。本文首先介绍了它的规律和特点,然后对它的复杂性进行了研究。通过对博弈状态空间的划分,根据具体条件,最终找到了其复杂性的上界。这个上限与跳棋的上限相当,因此,似乎解决这个博弈的开放挑战需要相当大的计算工作。

英文摘要:

Tablut is a complete-knowledge, deterministic, and asymmetric board game, which has not been solved nor properly studied yet. In this work, its rules and characteristics are presented, then a study on its complexity is reported. An upper bound to its complexity is found eventually by dividing the state-space of the game into subspaces according to specific conditions. This upper bound is comparable to the one found for Draughts, therefore, it would seem that the open challenge of solving this game requires a considerable computational effort.

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

↑