Or maybe he is the Conway from the Game of Life. In any case, we'll keep our Conway. (With apologies to TimToady).

I've seen the Minesweeper-NP-completeness thing before. I was trying to make a program to play minesweeper a while back, ran across that paper, and gave up. The solution would have been either a boring brute-force algorithm, or something that would get me a whole heap of cash when I used it to break encrypted credit cards win the NP-complete challenge contest.