Classifying CELESTE as NP Complete
Computational Complexity
2022-12-02 v4
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.
Cite
@article{arxiv.2012.07678,
title = {Classifying CELESTE as NP Complete},
author = {Zeeshan Ahmed and Alapan Chaudhuri and Kunwar Shaanjeet Singh Grover and Ashwin Rao and Kushagra Garg and Pulak Malhotra},
journal= {arXiv preprint arXiv:2012.07678},
year = {2022}
}
Comments
Keywords: complexity analysis, NP completeness, algorithmic analysis, game analysis