arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.16172cs.CC
收藏

西洋双陆棋难

Backgammon is Hard

R. Teal Witter

摘要:

我们研究了流行的棋盘游戏步步高的计算复杂性。我们表明,决定一个球员是否可以赢得从一个给定的董事会配置是NP难,PSPACE难,EXPTIME难已知和未知的对手的策略和掷骰子不同的设置。我们的工作回答了Erik Demaine在2001年提出的一个悬而未决的问题。特别是,对于现实生活中的设置,对手的策略和骰子滚动是未知的,我们证明,确定一个球员是否可以赢得是极限困难。有趣的是,我们并不清楚什么复杂性类严格包含我们考虑的每个问题,因为双陆棋游戏理论上可以无限期地继续作为捕获规则的结果。

英文摘要:

We study the computational complexity of the popular board game backgammon. We show that deciding whether a player can win from a given board configuration is NP-Hard, PSPACE-Hard, and EXPTIME-Hard under different settings of known and unknown opponents' strategies and dice rolls. Our work answers an open question posed by Erik Demaine in 2001. In particular, for the real life setting where the opponent's strategy and dice rolls are unknown, we prove that determining whether a player can win is EXPTIME-Hard. Interestingly, it is not clear what complexity class strictly contains each problem we consider because backgammon games can theoretically continue indefinitely as a result of the capture rule.

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

↑