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.
Cite
@article{arxiv.2211.11839,
title = {Celeste is PSPACE-hard},
author = {Lily Chung and Erik D. Demaine},
journal= {arXiv preprint arXiv:2211.11839},
year = {2022}
}
Comments
15 pages, 13 figures. Presented at 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games