Celeste is PSPACE-hard
Lily Chung, Erik D. Demaine

TL;DR
This paper proves that the platform game Celeste is computationally very complex, specifically PSPACE-hard, under various game mechanics, even in scenarios without player input, highlighting its theoretical difficulty.
Contribution
It establishes the PSPACE-hardness of Celeste across multiple game mechanic subsets, including cases without player input, advancing understanding of game complexity.
Findings
Celeste is PSPACE-hard in multiple scenarios.
The complexity holds even without player input.
Different subsets of game mechanics do not reduce the game's computational hardness.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Digital Games and Media · Educational Games and Gamification
