Submission + - Are all the best games NP-hard? (bris.ac.uk) 1

Submitted by Catullus on Friday April 09, 2010 @06:55AM

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 hard — NP-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?

This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Are all the best games NP-hard?

Load All Comments

Search 1 Comments Log In/Create an Account

Comments Filter:

There may be more comments in this discussion. Without JavaScript enabled, you might want to turn on Classic Discussion System in your preferences instead.

Advertising is a valuable economic factor because it is the cheapest way of selling goods, particularly if the goods are worthless. -- Sinclair Lewis

Submission + - Are all the best games NP-hard? (bris.ac.uk) 1

Are all the best games NP-hard? More Login

Are all the best games NP-hard?

Slashdot Top Deals

Slashdot