当前位置: X-MOL 学术arXiv.cs.GT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Computational Hardness of Multidimensional Subtraction Games
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-01-12 , DOI: arxiv-2001.03962
Vladimir Gurvich, Michael Vyalyi

We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove an existence of a game in this class such that solving the game is PSPACE-hard. The results are based on the construction introduced by Larsson and W\"astlund. It relates subtraction games and cellular automata.

中文翻译:

多维减法游戏的计算难度

我们研究了用有限差分集在固定维度上解决减法游戏的算法复杂性。我们证明在这个类中存在一个游戏,使得任何解决游戏的算法都在指数时间内运行。我们还证明了此类游戏的存在性,使得解决该游戏是 PSPACE 难的。结果基于 Larsson 和 W\"astlund 引入的构造。它涉及减法游戏和元胞自动机。
更新日期:2020-01-14
down
wechat
bug