Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets

06/01/2020
by   Joshua Ani, et al.
0

A door gadget has two states and three tunnels that can be traversed by an agent (player, robot, etc.): the "open" and "close" tunnel sets the gadget's state to open and closed, respectively, while the "traverse" tunnel can be traversed if and only if the door is in the open state. We prove that it is PSPACE-complete to decide whether an agent can move from one location to another through a planar assembly of such door gadgets, removing the traditional need for crossover gadgets and thereby simplifying past PSPACE-hardness proofs of Lemmings and Nintendo games Super Mario Bros., Legend of Zelda, and Donkey Kong Country. Our result holds in all but one of the possible local planar embedding of the open, close, and traverse tunnels within a door gadget; in the one remaining case, we prove NP-hardness. We also introduce and analyze a simpler type of door gadget, called the self-closing door. This gadget has two states and only two tunnels, similar to the "open" and "traverse" tunnels of doors, except that traversing the traverse tunnel also closes the door. In a variant called the symmetric self-closing door, the "open" tunnel can be traversed if and only if the door is closed. We prove that it is PSPACE-complete to decide whether an agent can move from one location to another through a planar assembly of either type of self-closing door. Then we apply this framework to prove new PSPACE-hardness results for eight different 3D Mario games and Sokobond.

READ FULL TEXT

page 13

page 14

page 27

page 28

page 30

page 32

page 33

page 34

research
03/30/2019

A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi

We review NP-hardness framework and PSPACE-hardness framework for a type...
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
06/06/2023

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs

In this paper we deal with the problem of computing the exact crossing n...
research
12/09/2021

Unique Assembly Verification in Two-Handed Self-Assembly

One of the most fundamental and well-studied problems in Tile Self-Assem...
research
06/14/2022

EXPTIME-hardness of higher-dimensional Minkowski spacetime

We prove the EXPTIME-hardness of the validity problem for the basic temp...
research
03/30/2022

Wordle is NP-hard

Wordle is a single-player word-guessing game where the goal is to discov...
research
01/12/2023

Hardness of Ruling Out Short Proofs of Kolmogorov Randomness

A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), ass...

Please sign up or login with your details

Forgot password? Click here to reset