Document Open Access Logo

Tetris Is Not Competitive

Authors Matthias Gehnen , Luca Venier

PDF
Thumbnail PDF

File

LIPIcs.FUN.2024.16.pdf
  • Filesize: 0.8 MB
  • 16 pages

Document Identifiers

Author Details

Matthias Gehnen
  • RWTH Aachen University, Germany
Luca Venier
  • RWTH Aachen University, Germany

Acknowledgements

This article bases on Luca Venier’s Mastes’s Thesis [Venier, 2023].

Cite As Get BibTex

Matthias Gehnen and Luca Venier. Tetris Is Not Competitive. In 12th International Conference on Fun with Algorithms (FUN 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 291, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.FUN.2024.16

Abstract

In the video game Tetris, a player has to decide how to place pieces on a board that are revealed by the game one after another. We show that the missing information about the upcoming pieces is indeed crucial to a player’s success. We present a construction for piece sequences that force (online) players without or with a finite preview of upcoming pieces to lose while (offline) players who know the entire piece sequence can clear the board and continue to play.
From a competitive analysis perspective, it follows that there cannot be any c-competitive online algorithm for various optimization goals in the context of playing Tetris. Furthermore, we improve existing results by providing a construction for piece sequences which force every player to lose for every possible board size with at least two columns. With this construction, we are also able to show that an instance with just 435 pieces is sufficient to force every player to lose on a standard-size board with ten columns and twenty rows.

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • Online Algorithms
  • Tetris

Metrics

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

References

  1. Playing forever - Hard Drop Tetris Wiki. https://harddrop.com/wiki/Playing_forever. Accessed: 2023-10-22. Google Scholar
  2. 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. URL: https://doi.org/10.2197/ipsjjip.28.942.
  3. Allan Borodin and Ran El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998. Google Scholar
  4. Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, and David Liben-Nowell. TETRIS IS HARD, EVEN TO APPROXIMATE. International Journal of Computational Geometry & Applications, 14(01n02):41-68, April 2004. URL: https://doi.org/10.1142/S0218195904001354.
  5. Ron Breukelaar, Hendrik Jan Hoogeboom, and Walter A Kosters. Tetris is Hard, Made Easy. Technical Report 2003-9, Leiden Institute of Advanced Computer Science, 2003. Google Scholar
  6. John Brzustowski. Can You Win at Tetris? Master’s thesis, The University of British Columbia, March 1992. URL: https://doi.org/10.14288/1.0079748.
  7. Heidi Burgiel. How to lose at Tetris. The Mathematical Gazette, 81(491):194-200, July 1997. URL: https://doi.org/10.2307/3619195.
  8. Justin Dallant and John Iacono. How fast can we play tetris greedily with rectangular pieces? Theoretical Computer Science, 992:114405, 2024. URL: https://doi.org/10.1016/j.tcs.2024.114405.
  9. Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell. Tetris is Hard, Even to Approximate, October 2002. URL: https://arxiv.org/abs/cs/0210020.
  10. Vadim Gerasimov. Original Tetris: Story and Download. https://vadim.oversigma.com/Tetris.htm. Accessed: 2023-10-23. Google Scholar
  11. Dennis Komm. An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-42749-2.
  12. Simon Laroche. The history of Tetris randomizers. https://simon.lc/the-history-of-tetris-randomizers, November 2018. Accessed: 2023-10-01. Google Scholar
  13. Daniel Dominic Sleator and Robert Endre Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202-208, 1985. URL: https://doi.org/10.1145/2786.2793.
  14. Oscar Temprano. Complexity of a Tetris variant. CoRR, June 2015. URL: https://arxiv.org/abs/1506.07204.
  15. Kaitlyn Tsuruda. A closer look at TETRIS: Analysis of a variant game. Atlantic Electronic Journal of Mathematics [electronic only], 4, January 2011. Google Scholar
  16. Luca Venier. Online Tetris. Master’s thesis, RWTH Aachen University, November 2023. 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 About DROPS Imprint Privacy Contact