Here's the actual press release. Schaeffer is the guy to whom correspondence should be addressed. Jonathan Schaeffer , E-mail: jonathan@cs.ualberta.ca <mailto:jonathan@cs.ualberta.ca> The game of checkers has roughly 500 billion billion possible^ positions (5 x 10^20 ). The task of solving the game, determining^ the final result in a game with no mistakes made by either player,^ is daunting. Since 1989, almost continuously, dozens of computers^ have been working on solving checkers, applying state-of-the-art^ artificial intelligence techniques to the proving process. This^ paper announces that checkers is now solved: perfect play by^ both sides leads to a draw. This is the most challenging popular^ game to be solved to date, roughly one million times more complex^ than Connect Four. Artificial intelligence technology has been^ used to generate strong heuristic-based game-playing programs,^ such as DEEP BLUE for chess. Solving a game takes this to the^ next level, by replacing the heuristics with perfection. Does anyone know if a quantum computer, assuming they're perfected, whatever that means, could solve Go or chess? Steve Gray