Document Open Access Logo

Advanced Spikes `n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable

Authors Christian Ikenmeyer , Dylan Khangure

PDF
Thumbnail PDF

File

LIPIcs.FUN.2024.18.pdf
  • Filesize: 0.72 MB
  • 13 pages

Document Identifiers

Author Details

Christian Ikenmeyer
  • University of Warwick, UK
Dylan Khangure
  • University of Warwick, UK

Cite AsGet BibTex

Christian Ikenmeyer and Dylan Khangure. Advanced Spikes `n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable. In 12th International Conference on Fun with Algorithms (FUN 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 291, pp. 18:1-18:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.FUN.2024.18

Abstract

We adjust Alan Hazelden’s 2017 polynomial time solvable puzzle game Spikes `n' Stuff: We obtain the NP-complete puzzle game Advanced Spikes `n' Stuff with 3 trap types so that each strict subset of the traps results in a polynomial time solvable puzzle game. We think of this as a "hard game in which all tutorial levels are easy". The polynomial time algorithms for solving the tutorial games turn out to be quite different to each other. While numerous papers analyze the complexity of games and which game objects make a game NP-hard, our paper is the first to study a game where the NP-hardness can only be achieved by a combination of all game objects, assuming P differs from NP.

Subject Classification

ACM Subject Classification
  • Theory of computation → Problems, reductions and completeness
Keywords
  • computational complexity
  • P vs NP
  • motion planning
  • games

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Spikes `n' Stuff. https://draknek.itch.io/spikes-n-stuff, https://alan.draknek.org/games/puzzlescript/spikes-n-stuff.php. Accessed: 25/02/2024.
  2. Zeeshan Ahmed, Alapan Chaudhuri, Kunwar Shaanjeet Singh Grover, Ashwin Rao, Kushagra Garg, and Pulak Malhotra. Classifying Celeste as NP Complete. In International Conference on Foundations of Computer Science & Technology, Chennai, India, November 2022. Google Scholar
  3. Greg Aloupis, Erik D Demaine, Alan Guo, and Giovanni Viglietta. Classic Nintendo Games are (Computationally) Hard. Theoretical Computer Science, 586:135-160, 2015. Google Scholar
  4. Sualeh Asif, Michael Coulombe, Erik D Demaine, Martin L Demaine, Adam Hesterberg, Jayson Lynch, and Mihir Singhal. Tetris is NP-hard even with O(1) rows or columns. Journal of Information Processing, 28:942-958, 2020. Google Scholar
  5. Lily Chung and Erik D. Demaine. Celeste is PSPACE-hard. Thai Journal of Mathematics, 21(4):671-686, December 2023. Google Scholar
  6. Graham Cormode. The Hardness of the Lemmings Game, or Oh no, more NP-Completeness Proofs. In Proceedings of Third International Conference on Fun with Algorithms, pages 65-76, 2004. Google Scholar
  7. Diogo M Costa, Alexandre P Francisco, and Luís Russo. Hardness of Modern Games. arXiv:2005.10506, 2020. Google Scholar
  8. Erik D Demaine, Martin L Demaine, and Joseph O'Rourke. PushPush and Push-1 are NP-hard in 2D. In Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG 2000), pages 211-219, August 2000. Google Scholar
  9. Erik D. Demaine, Joshua Lockhart, and Jayson Lynch. The Computational Complexity of Portal and other 3D Video Games. In 9th International Conference on Fun with Algorithms (FUN 2018), volume 100, pages 19:1-19:22, 2018. Google Scholar
  10. Dorit Dor and Uri Zwick. SOKOBAN and other motion planning problems. Computational Geometry, 13(4):215-228, 1999. Google Scholar
  11. Michal Forišek. Computational complexity of two-dimensional platform games. In Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings 5, pages 214-227. Springer, 2010. Google Scholar
  12. Daniel Král, Vladan Majerech, Jiří Sgall, Tomáš Tichý, and Gerhard Woeginger. It is tough to be a plumber. Theoretical computer science, 313:473-484, 2004. Google Scholar
  13. Giovanni Viglietta. Gaming is a hard job, but someone has to do it! Theory of Computing Systems, 54:595-621, 2014. Google Scholar
  14. Giovanni Viglietta. Lemmings is PSPACE-complete. Theoretical Computer Science, 586:120-134, 2015. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact