Home > slashdot > All the Best Games May Be NP-Hard

All the Best Games May Be NP-Hard

April 9th, 2010 04:25 admin Leave a comment Go to comments

Catullus writes “Following in the footsteps of Tetris and Minesweeper, the simple yet addictive multiplatform game Flood-It is the latest puzzle to be proven to be hardNP-hard, to be exact. This means that there’s no way to write an efficient program to beat the game, unless P=NP. This research by computer scientists from Bristol University raises the intriguing question: are these games fun precisely because they’re hard for computers to solve, and need a spark of human creativity?”

Source: All the Best Games May Be NP-Hard

Related Articles:

  1. Bruce Bueno de Mesquita Uses Games To See the Future
  2. Computer Defeats Human At Japanese Chess
  3. Computer Games and Traditional CS Courses
  4. DirectX 11 Coming To Browser Games
  5. Sony Planning Serial Keys For PS3 Games?
blog comments powered by Disqus