Minesweeper is NP-complete.

November 17th, 2008

Apperently Minesweeper is a computationally intractable problem. My fastest time on the Easy grid is 5 seconds.

Wikipedia explains NP-completeness.

Are humans next? Reminds me (no pun intended) of the film The Eternal Sunshine of the Spotless Mind.

BBC NEWS | Americas | US scientists ‘erase mice memory’.