Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,...
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,...
| Hauptverfasser: | , , , , , |
|---|---|
| Weitere Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Information Processing Society of Japan
2020
|
| Online Zugang: | https://hdl.handle.net/1721.1/127800 |