Advertisement

PSPACE-Completeness of Bloxorz and of Games with 2-Buttons

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9079)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bloxorz, DX Interactive. http://dxinteractive.com/#!/bloxorz
  2. 2.
  3. 3.
  4. 4.
    van der Zanden, T.C., Bodlaender, H.L.: PSPACE-Completeness of Bloxorz and of Games with 2-Buttons arXiv:1411.5951 (2014)
  5. 5.
    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) CrossRefGoogle Scholar
  6. 6.
    Viglietta, G.: Gaming Is a Hard Job, but Someone Has to Do It!. Theory Comput. Syst. 54(4), 595–621 (2014)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    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) CrossRefGoogle Scholar
  8. 8.
    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)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Buchin, K., Buchin, M.: Rolling block mazes are PSPACE-complete. Journal of Information Processing 20(3), 719–722 (2012)CrossRefGoogle Scholar
  10. 10.
    Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 177–192 (1970)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Hearn, R.A., Demaine, E.D.: Games Puzzles, and Computation. A K Peters/CRC Press (2009)Google Scholar
  12. 12.
    Reingold, O.: Undirected connectivity in log-space. Journal of the ACM 55(4), article 17 (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceUtrecht UniversityUtrechtThe Netherlands
  2. 2.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations