Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes
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.
Unable to display preview. Download preview PDF.
- 2.Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory 1(1), article 4 (2009)Google Scholar
- 3.Demaine, E.D., Hearn, R.A.: A uniform framework for modeling computations as games. In: Proc. Conf. Comput. Compl., pp. 149–162. Computer Society Press, College Park (2008)Google Scholar
- 4.Holzer, M., Jakobi, S.: On the complexity of rolling block and Alice mazes. IFIG Research Report 1202, Institut für Informatik, Justus-Liebig-Universität Gießen, Arndtstr. 2, D-35392 Gießen, Germany (2012)Google Scholar
- 5.Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)Google Scholar
- 6.Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), Article 17 (24 pages) (2008)Google Scholar