10.30.2002 10:22 AM
Ars Technica just posted a link to some research that was done to show that Tetris is basically an NP-complete problem. The link to the site is here - you can get a bunch of different file formats for the research paper (like PDF, PS, etc.). It's not easy reading, but it's nice to know that AI/cognitive scientists have more games to work on other than chess (Go also falls into this realm as current Go computer players are pretty bad).
* Posted at 10.30.2002 10:22:00 AM CST | Link *