c ○ World Scientific Publishing Company TETRIS IS HARD, EVEN TO APPROXIMATE ∗

@inproceedings{HARD2003cW,
  title={c ○ World Scientific Publishing Company TETRIS IS HARD, EVEN TO APPROXIMATE ∗},
  author={TETRIS IS HARD and EVEN TO APPROXIMATE and Ron Breukelaar and B. Zhu and Walter A. Kosters and Alexey Pazhitnov},
  year={2003}
}
  • TETRIS IS HARD, EVEN TO APPROXIMATE, +3 authors Alexey Pazhitnov
  • Published 2003
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 filled squares above it drop by one row. We prove that in the offline version of Tetris, it is… CONTINUE READING