Abstract
Bloxorz is an online puzzle game where players move a \(1 \times 1 \times 2\) block by tilting it on a subset of the two dimensional grid, that also features switches that open and close trapdoors. The puzzle is to move the block from its initial position to an upright position on the goal square. We show that the problem of deciding whether a given Bloxorz level is solvable is \(\mathsf{PSPACE}\)-complete and that this remains so even when all trapdoors are initially closed or all trapdoors are initially open. We also answer an open question of Viglietta [6], showing that 2-buttons are sufficient for \(\mathsf{PSPACE}\)-hardness of general puzzle games. We also examine the hardness of some variants of Bloxorz, including variants where the block is a \(1 \times 1 \times 1\) cube, and variants with single-use tiles.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bloxorz, DX Interactive. http://dxinteractive.com/#!/bloxorz
Ice Cube Caveman, Google Play Store. https://play.google.com/store/apps/details?id=com.TwistedGames.Caveman
Ice Cube Caveman, iTunes App Store. https://itunes.apple.com/app/ice-cube-caveman/id456179222?mt=8
van der Zanden, T.C., Bodlaender, H.L.: PSPACE-Completeness of Bloxorz and of Games with 2-Buttons arXiv:1411.5951 (2014)
Viglietta, G.: Gaming is a hard job, but someone has to do it!. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 357–367. Springer, Heidelberg (2012)
Viglietta, G.: Gaming Is a Hard Job, but Someone Has to Do It!. Theory Comput. Syst. 54(4), 595–621 (2014)
Forišek, M.: Computational complexity of two-dimensional platform games. In: Boldi, P. (ed.) FUN 2010. LNCS, vol. 6099, pp. 214–227. Springer, Heidelberg (2010)
Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343, 72–96 (2005)
Buchin, K., Buchin, M.: Rolling block mazes are PSPACE-complete. Journal of Information Processing 20(3), 719–722 (2012)
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 177–192 (1970)
Hearn, R.A., Demaine, E.D.: Games Puzzles, and Computation. A K Peters/CRC Press (2009)
Reingold, O.: Undirected connectivity in log-space. Journal of the ACM 55(4), article 17 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
van der Zanden, T.C., Bodlaender, H.L. (2015). PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. In: Paschos, V., Widmayer, P. (eds) Algorithms and Complexity. CIAC 2015. Lecture Notes in Computer Science(), vol 9079. Springer, Cham. https://doi.org/10.1007/978-3-319-18173-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-18173-8_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18172-1
Online ISBN: 978-3-319-18173-8
eBook Packages: Computer ScienceComputer Science (R0)