Submission + - Solve Minesweeper, Win A Million Dollars (claymath.org)
Odiumjunkie writes: Ian Stewart's lecture explains "Minesweeper Consistency Problems" as an NP-complete problem set, based around the popular Minesweeper computer game. The Clay Mathematics institute overs a one million dollar prize for the trivial task of proving or disproving P=NP.