Million-dollar prize for P=NP proof of Minesweeper

Daen sez: "One of the million-dollar Clay Mathematics Institute problems is the P versus NP problem. There's an excellent description of how minesweeper relates to this problem (it has been proven to be NP-complete) and also descriptions of how to make logic gates out of minesweeper configurations…"



(Thanks, Daen!)