Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Computing
Rolling Block Mazes are PSPACE-complete
Kevin BuchinMaike Buchin
Author information
JOURNAL FREE ACCESS

2012 Volume 7 Issue 3 Pages 1025-1028

Details
Abstract
In a rolling block maze, one or more blocks lie on a rectangular board with square cells. In most mazes, the blocks have size k × m × n where k, m, n are integers that determine the size of the block in terms of units of the size of the board cells. The task of a rolling block maze is to roll a particular block from a starting to an ending placement. A block is rolled by tipping it over one of its edges. Some of the squares of the board are marked as forbidden to roll on. We show that solving rolling block mazes is PSPACE-complete.
Content from these authors
© 2012 Information Processing Society of Japan
Previous article Next article
feedback
Top