Paper by Erik D. Demaine

Reference:

Lily Chung and Erik D. Demaine, “Celeste is PSPACE-hard”, in Abstracts from the 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCGGG 2021), September 3–5, 2021, pages 76–77.

Abstract:

We investigate the complexity of the platform video game Celeste. We prove that navigating Celeste is PSPACE-hard in four different ways, corresponding to different subsets of the game mechanics.

Comments:

The full paper is available as arXiv:2211.11839.

Availability:

The abstract is available in PDF (282k).

See information on file formats.

[Google Scholar search]

Related papers:

Celeste_TJM (Celeste is PSPACE-hard)