论文标题
现代游戏的硬度
Hardness of Modern Games
论文作者
论文摘要
我们考虑了现代益智游戏的复杂性，六角形，剪绳索并返回床。游戏的复杂性在为玩家提供的体验类型中起着重要作用。返回床被证明是pspace-hard，前两个被证明是np-hard。这些结果可以进一步深入了解这些游戏的结构，而所得的结构可能在进一步的复杂性研究中很有用。
We consider the complexity properties of modern puzzle games, Hexiom, Cut the Rope and Back to Bed. The complexity of games plays an important role in the type of experience they provide to players. Back to Bed is shown to be PSPACE-Hard and the first two are shown to be NP-Hard. These results give further insight into the structure of these games and the resulting constructions may be useful in further complexity studies.
