No, I’m not talking about Nixon’s dog.
It was announced this last week that computer modeling has solved the game of checkers, and proven that a perfectly-played game will always end in a tie. Honestly, I’m not sure how I feel about this. This is, in a way, the Ur-boardgame, really the first strategy game we play with our kids (okay, maybe second behind tic-tac-toe), and to learn that everything there is to know about it has been discovered is a bit of a let-down. On the other hand, it provides one more way to convince the W.O.P.R. that "The only winning move is not to play."
