You read that right: Computer scientists at the University of Alberta have shown that a perfectly played game of checkers will end in a draw, and thereby created a game database that provably can’t be beaten. Read my story in Nature before it goes into their for-pay archive in a few days.
May I just say how much I love writing for Nature? The assignments are interesting, the format is perfect for a few hours’ work, and they pay well and quickly. Most importantly, my editor (Nicola Jones) is a gem: She’s efficient, insightful, and communicative.
One of Nicola’s queries led me to a fact undiscovered by all other reporters — the one about needing to explore only 1/5,000,000th of the available positions to make the proof. Good stuff.
EDIT: It’s on Slashdot.
