Tetris is NP-hard even with O(1) rows or columns

09/29/2020
by   Sualeh Asif, et al.
0

We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open problems posed over 15 years ago [BDH+04]. Our reduction is from 3-Partition, similar to the previous reduction for unrestricted board sizes, but with a better packing of buckets. On the positive side, we prove that 2-column Tetris (and 1-row Tetris) is polynomial. We also prove that the generalization of Tetris to larger k-omino pieces is NP-complete even when the board starts empty, even when restricted to 3 columns or 2 rows or constant-size pieces. Finally, we present an animated Tetris font.

READ FULL TEXT

page 5

page 7

page 10

page 11

page 13

page 16

page 18

page 19

research
08/16/2019

LaserTank is NP-complete

We show that the classical game LaserTank is NP-complete, even when the ...
research
04/29/2021

Revising Johnson's table for the 21st century

What does it mean today to study a problem from a computational point of...
research
08/18/2022

Perfect Out-forests and Steiner Cycle Packing in Digraphs

In this paper, we study the complexity of two types of digraph packing p...
research
06/21/2017

Solving the Rubik's Cube Optimally is NP-complete

In this paper, we prove that optimally solving an n × n × n Rubik's Cube...
research
04/23/2020

Coloring Problems on Bipartite Graphs of Small Diameter

We investigate a number of coloring problems restricted to bipartite gra...
research
03/22/2020

1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete

Consider n^2-1 unit-square blocks in an n × n square board, where each b...
research
01/03/2012

The RegularGcc Matrix Constraint

We study propagation of the RegularGcc global constraint. This ensures t...

Please sign up or login with your details

Forgot password? Click here to reset