1 paper · 1 filter
Zeeshan Ahmed, Alapan Chaudhuri, Kunwar Shaanjeet Singh Grover +3
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 s…