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.

Filed in Gaming, Science Tagged with , , ,
Posted by Ivan
No Comments »