Celeste is PSPACE-hard

11/21/2022
by   Lily Chung, et al.
0

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.

READ FULL TEXT

page 2

page 6

page 7

page 8

page 10

page 11

page 14

research
03/31/2022

The Legend of Zelda: The Complexity of Mechanics

We analyze some of the many game mechanics available to Link in the clas...
research
03/09/2023

Computational bounds for the 2048 game

2048 is a single player video game, played by millions mostly on mobile ...
research
05/22/2023

Perfect Information Hearthstone is PSPACE-hard

We consider the computational complexity of Hearthstone which is a popul...
research
05/09/2019

Jcave: A 3D Interactive Game to Assist Home Physiotherapy Rehabilitation

The purpose of this paper is to investigate the applicability of applyin...
research
06/30/2021

Backgammon is Hard

We study the computational complexity of the popular board game backgamm...
research
06/27/2019

A Game Model for Proofs with Costs

We look at substructural calculi from a game semantic point of view, gui...
research
02/02/2023

This Game Is Not Going To Analyze Itself

We analyze the puzzle video game This Game Is Not Going To Load Itself, ...

Please sign up or login with your details

Forgot password? Click here to reset