|
 |
"Maths proves Tetris is tough," by Helen Pearson. Nature Science Update, 28 October 2002.
Those who have trouble solving Tetris can take heart in the fact that Erik Demaine and two other colleagues have shown that the problem of playing Tetris efficiently is NP-complete. Tetris is a popular computer game involving fitting pieces -- made up of four squares -- that drop from the top of the screen into openings in rows. It may sound easy, but Demaine and his colleagues have now confirmed that it is not. Pearson points out that other games, like chess and Go, are even harder.
--- Mike Breen
 |
Comments: Email Webmaster |
