Constraint Logic: A Uniform Framework for Modeling Computation as Games
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Undirected connectivity in log-space
Journal of the ACM (JACM)
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Planar and Grid Graph Reachability Problems
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
On the complexity of rolling block and alice mazes
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Hi-index | 0.00 |
We investigate the computational complexity of some maze problems, namely the reachability problem for (undirected) grid graphs with diagonal edges, and the solvability of Xmas tree mazes. Simply speaking, in the latter game one has to move sticks of a certain length through a maze, ending in a particular game situation. It turns out that when the number of sticks is bounded by some constant, these problems are closely related to the grid graph problems with diagonals. If on the other hand an unbounded number of sticks is allowed, then the problem of solving such a maze becomes PSPACE-complete. Hardness is shown via a reduction from the nondeterministic constraint logic (NCL) of [E. D. Demaine, R. A. Hearn: A uniform framework or modeling computations as games. Proc. CCC, 2008] to Xmas tree mazes.