Celeste is PSPACE-hard
Discrete and Computational Geometry, Graphs, and Games
Keywords:video games, hardness, PSPACE
We investigate the complexity of the platform video game Celeste. We prove that navigating Celeste is PSPACE-hard in five different ways, corresponding to different subsets of the game mechanics. In particular, we prove the game PSPACE-hard even without player input.