Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Susan Hohenberger, and David Liben-Nowell, “Tetris is Hard, Even to Approximate”, in Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003), Big Sky, Montana, July 25–28, 2003, pages 351–363.

BibTeX

@InProceedings{Tetris_COCOON2003,
  AUTHOR        = {Erik D. Demaine and Susan Hohenberger and David Liben-Nowell},
  TITLE         = {Tetris is Hard, Even to Approximate},
  BOOKTITLE     = {Proceedings of the 9th International Computing and
                   Combinatorics Conference (COCOON 2003)},
  BOOKURL       = {http://www.cs.montana.edu/bhz/cocoon03.html},
  ADDRESS       = {Big Sky, Montana},
  MONTH         = {July 25--28},
  YEAR          = 2003,
  PAGES         = {351--363},

  PAPERS        = {Tetris_IJCGA; Tetris_CGW2002; Tetris_TR2002},
  LENGTH        = {12 pages},
  UPDATES       = {Ivars Peterson wrote an article describing these results,
                   &ldquo;<A HREF="http://www.sciencenews.org/20021026/mathtrek.asp">Tetris
                   Is Hard</A>&rdquo;,
                   <I><A HREF="http://www.sciencenews.org/">Science
                   News</A></I> 162(17), October 26, 2002.
                   <P>
                   Helen Pearson also wrote an article describing these results,
                   &ldquo;<A HREF="http://www.nature.com/nsu/021021/021021-9.html">Maths
                   proves Tetris is tough</A>&rdquo;,
                   <I><A HREF="http://www.nature.com/nsu/">Nature
                   Science Update</A></I>, October 28, 2002.
                   <P>
                   Sarah Graham also wrote a short article describing these
                   results,
                   &ldquo;<A HREF="http://www.sciam.com/article.cfm?chanID=sa003&articleID=000EB124-AE08-1DBD-94E2809EC5880108">Mathematicians
                   Prove Tetris is Tough</A>&rdquo;,
                   <I><A HREF="http://www.sciam.com/news_directory.cfm">Scientific
                   American News</A></I>, October 29, 2002.},
  webpages      = {fonts/tetris},
  doi           = {https://dx.doi.org/10.1007/3-540-45071-8_36},
  dblp          = {https://dblp.org/rec/conf/cocoon/DemaineHL03},
  comments      = {This paper is also available as <A HREF="https://arXiv.org/abs/cs/0210020">arXiv:cs/0210020</A>, and from <A HREF="https://doi.org/10.1007/3-540-45071-8_36">SpringerLink</A>.},
}

Abstract:

In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the gameboard is cleared and all pieces above it drop by one row. We prove that in the offline version of Tetris, it is NP-complete to maximize the number of cleared rows, maximize the number of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize the number of pieces placed before the game ends. We furthermore show the extreme inapproximability of the first and last of these objectives to within a factor of p^1 − ε, when given a sequence of p pieces, and the inapproximability of the third objective to within a factor of 2 − ε, for any ε > 0. Our results hold under several variations on the rules of Tetris, including different models of rotation, limitations on player agility, and restricted piecesets.

Comments:

This paper is also available as arXiv:cs/0210020, and from SpringerLink.

Updates:

Ivars Peterson wrote an article describing these results, “Tetris Is Hard”, Science News 162(17), October 26, 2002.

Helen Pearson also wrote an article describing these results, “Maths proves Tetris is tough”, Nature Science Update, October 28, 2002.

Sarah Graham also wrote a short article describing these results, “Mathematicians Prove Tetris is Tough”, Scientific American News, October 29, 2002.

Length:

The paper is 12 pages.

Availability:

The paper is available in PostScript (1330k), gzipped PostScript (97k), and PDF (217k).

See information on file formats.

[Google Scholar search]

Related papers:

Tetris_IJCGA (Tetris is Hard, Even to Approximate)

Tetris_CGW2002 (Tetris is Hard, Even to Approximate)

Tetris_TR2002 (Tetris is Hard, Even to Approximate)

Related webpages:

Tetris Font