4 ms·

Pretty sure about ten years back a team at MIT did a paper on how Tetris is NP-Complete...

• croikle 13y ago
  Note that results like this [0] tend to be for generalizations. '''It is natural to generalize the Tetris gameboard to m-by-n, since a relatively simple dynamic program solves the case of a constant-size gameboard in time polynomial in the number of pieces.''' [0] http://arxiv.org/abs/cs/0210020 http://arxiv.org/abs/cs/0210020