MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,...

Author(s)
Demaine, Erik D; Demaine, Martin L; Eisenstat, Sarah Charmian; Hesterberg, Adam Classen; Lincoln, Andrea I; Lynch, Jayson R.; ... Show more Show less
Thumbnail
DownloadAccepted version (602.7Kb)
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We consider variations on the classic video game Tetris where pieces are k-ominoes instead of the usual tetrominoes (k = 4), as popularized by the video games ntris and Pentris. We prove that it is NP-complete to survive or clear a given initial board with a given sequence of pieces for each k ≤ 5, complementing the previous NP-completeness result for k = 4. More surprisingly, we show that board clearing is NP-complete for k = 3; and if pieces may not be rotated, then clearing is NP-complete for k = 2 and survival is NP-complete for k = 3. All of these problems can be solved in polynomial time for k = 1.
Date issued
2017
URI
https://hdl.handle.net/1721.1/127800
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Journal of Information Processing
Publisher
Information Processing Society of Japan
Citation
Demaine, Erik D. et al. "Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,...." Journal of Information Processing 25 (2017): 515-527 © 2017 Information Processing Society of Japan
Version: Author's final manuscript

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.