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

Monday, January 21, 2008

Indian student shot -- Not featured in US news?

NDTV article

The hindu

The surprising part at the end of all this is
that the US press does not seem to have caught on
to the news and none of the sites seem to be featuring
this news yet. Either it is important or these shootings
are treated as mundane.