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.

翻译：我们分析了电子游戏“CELESTE”的计算复杂性,并证明解决它的普遍水平是NP-Compllete。此外,我们还展示了在引入游戏机械学的小改变(添加一个新的游戏实体)后,我们如何能够让它完成PSPACE。