From the paper: > For these games, we consider the decision problem of reachability: given a stage or dungeon, is it possible to reach the goal point t from th

From the paper: > For these games, we consider the decision problem of reachability: given a stage or dungeon, is it possible to reach the goal point t from the start point s? Our results apply to generalizations of the games where we only generalize the map size and leave all other mechanics of the games as they are in their original settings. Most of our NP-hardness proofs are by reduction from 3-SAT.