On the Complexity of Rolling Block and Alice Mazes

We investigate the computational complexity of two maze problems, namely rolling block and Alice mazes. Simply speaking, in the former game one has to roll blocks through a maze, ending in a particular game situation, and in the latter one, one has to move tokens of variable speed through a maze following some prescribed directions. It turns out that when the number of blocks or the number of tokens is not restricted (unbounded), 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 the problems in question. By using only blocks of size 2×1×1, and no forbidden squares, we improve a previous result of [K. Buchin, M. Buchin: Rolling block mazes are PSPACE-complete. J. Inform. Proc., 2012] on rolling block mazes to best possible. Moreover, we also consider bounded variants of these maze games, i.e., when the number of blocks or tokens is bounded by a constant, and prove close relations to variants of graph reachability problems.

[1]  Martin Kutrib.  Efficient Universal Pushdown Cellular Automata and Their Application to Complexity , 2001, MCU.

[2]  Martin Kutrib,et al.  Cellular automata with sparse communication , 2010, Theor. Comput. Sci..

[3]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[4]  Kevin Buchin,et al.  Rolling Block Mazes are PSPACE-complete , 2012, J. Inf. Process..

[5]  Martin Kutrib,et al.  A Time Hierarchy for Bounded One-Way Cellular Automata , 2001, MFCS.

[6]  Markus Holzer,et al.  Tight Bounds on the Descriptional Complexity of Regular Expressions , 2009, Developments in Language Theory.

[7]  Erik D. Demaine,et al.  Games, puzzles and computation , 2009 .

[8]  Markus Holzer,et al.  Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes , 2012, FUN.

[9]  Martin Kutrib,et al.  Unary Language Operations and Their Nondeterministic State Complexity , 2002, Developments in Language Theory.

[10]  Martin Kutrib,et al.  Fault Tolerant Parallel Pattern Recognition , 2000, ACRI.

[11]  Martin Kutrib,et al.  Nondeterministic Descriptional Complexity Of Regular Languages , 2003, Int. J. Found. Comput. Sci..

[12]  Martin Kutrib,et al.  Improving Raster Image Run-Length Encoding Using Data Order , 2001, CIAA.

[13]  Martin Kutrib,et al.  Fast one-way cellular automata , 2003, Theor. Comput. Sci..

[14]  Martin Kutrib.  Refining Nondeterminism below Linear-Time , 2001, DCFS.

[15]  Martin Kutrib,et al.  String Transformation for n -Dimensional Image Compression , 2002, SOFSEM.

[16]  Martin Kutrib,et al.  Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k , 2003, ICALP.

[17]  Andreas Maletti,et al.  An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton , 2009, CIAA.

[18]  Martin Kutrib,et al.  Deterministic Turing machines in the range between real-time and linear-time , 2002, Theor. Comput. Sci..

[19]  Martin Kutrib,et al.  Massively parallel fault tolerant computations on syntactical patterns , 2002, Future Gener. Comput. Syst..

[20]  Martin Kutrib,et al.  Economy of Descriptions for Basic Constructions on Rational Transductions , 2002, DCFS.

[21]  Martin Kutrib.  Below Linear-time: Dimensions versus Time Justus-liebig- Universit at Gieeen below Linear-time: Dimensions versus Time , 2000 .

[22]  Martin Kutrib,et al.  Massively Parallel Pattern Recognition with Link Failures , 2000, SOFSEM.

[23]  Eric Allender,et al.  Planar and Grid Graph Reachability Problems , 2009, Theory of Computing Systems.

[24]  Martin Kutrib,et al.  State complexity of basic operations on nondeterministic finite automata , 2002, CIAA'02.

[25]  GermanyMartin Kutrib.  Grammars with Scattered Nonterminals , 2002 .

[26]  Martin Kutrib.  Automata arrays and context-free languages , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[27]  Erik D. Demaine,et al.  Constraint Logic: A Uniform Framework for Modeling Computation as Games , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[28]  Hermann Gruber,et al.  August 2009 Simplifying Regular Expressions : A Quantitative Perspective , 2009 .

[29]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[30]  Martin Kutrib,et al.  Flip-Pushdown Automata: Nondeterminism Is Better than Determinism , 2003, Developments in Language Theory.

[31]  Erik D. Demaine,et al.  On Rolling Cube Puzzles , 2007, CCCG.

[32]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.