2 ms·
For those that care, a few years ago some researchers proved Tetris is NP-complete for many problems. http://arxiv.org/abs/cs.CC/0210020 http://arxiv.org/abs/c
by Xk 15y ago
For those that care, a few years ago some researchers proved Tetris is NP-complete for many problems.
http://arxiv.org/abs/cs.CC/0210020 http://arxiv.org/abs/cs.CC/0210020
- algolicious 15y agoThe paper tells us that Brzustowski and Burgeil already showed that a loss is forced for alternating S and Z pieces. But it is easy to see that you can get 1 line with S and Z simply by putting the thick part in the middle, and this is all the author wants.
- Xk 15y agoYeah, I realize that -- I'm just saying, for people who want to read more on the subject of Tetris there is a lot out there.