论文标题
将Celeste分类为NP完成
Classifying CELESTE as NP Complete
论文作者
论文摘要
我们分析了视频游戏“ celeste”的计算复杂性，并证明在其中解决了广义级别是NP完整的。此外，我们还展示了如何在引入游戏机制（添加新的游戏实体）的微小变化后，我们可以使其使其完整。
We analyze the computational complexity of the video game "CELESTE" and prove that solving a generalized level in it is NP-Complete. Further, we also show how, upon introducing a small change in the game mechanics (adding a new game entity), we can make it PSPACE-complete.
