Tuesday, January 22, 2008

Tetris is NP-Hard

Researchers at the LCS MIT proved that
Tetris is NP-Hard. This suggests that
even with sufficient time to make
every move tetris is not solvable
through a direct deterministic algorithm.

Full post at slashdot.org

0 comments:

Post a Comment