Classifying CELESTE as NP Complete

no code implementations • 14 Dec 2020 • Zeeshan Ahmed, Alapan Chaudhuri, Kunwar Shaanjeet Singh Grover, Hrishi Narayanan, Manasvi Vaidyula, Shreyas Pradhan

We analyze the computational complexity of the video game "CELESTE" and prove that solving a generalized level in it is NP-Complete.

Protein Folding Computational Complexity