Classifying CELESTE as NP Complete
Zeeshan Ahmed, Alapan Chaudhuri, Kunwar Shaanjeet Singh Grover, Ashwin, Rao, Kushagra Garg, Pulak Malhotra
TL;DR
This paper proves that solving generalized levels of the video game CELESTE is NP-Complete, and with minor modifications, it becomes PSPACE-Complete, highlighting its computational complexity.
Contribution
It establishes the NP-Completeness of CELESTE and demonstrates how slight game mechanic changes increase complexity to PSPACE-Complete.
Findings
Generalized CELESTE levels are NP-Complete.
Adding a new game entity makes the problem PSPACE-Complete.
Complexity classification informs game design and computational theory.
Abstract
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.
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 · Computability, Logic, AI Algorithms · Digital Games and Media