Checkers Solved, Unbeatable Database Created
tgeller writes "My story on the Nature site announced that a team of computer scientists at the University of Alberta has solved checkers. From the game's 500 billion billion positions (5 * 10^20), 'Chinook' has determined which 100,000 billion (10^14) are needed for their proof, and run through all relevant decision trees. They've set up a site where you can see the proof, traverse the logic, and play their unbeatable automaton. '[Jonathan] Schaeffer notes that his research has implications beyond the checkers board. The same algorithms his team writes to solve games could be helpful in searching other databases, such as vast lists of biological information because, as he says, "At the core, they both reduce to the same fundamental problem: large, compressed data sets that have to be accessed quickly."'"
Wow. Reminds me of how awesome I thought I was when I was 7 years old and I solved Tic Tac Toe.
--- Often in error; never in doubt!
Also, I've heard before that "it takes longer to learn to play checkers at the master level than it does chess. What checkers lacks in breadth, it makes up in precision and finality." I realize that puts me at risk of being modded as flamebait but I wonder if any other Slashdot reader can confirm or contest that.
My work here is dung.
RTFA: 10^46.
According to the site, it's a draw.
'course, Go would be kind of dull too on an 4x8 board (checkers only uses half the squares)1 6.html
http://www.chessvariants.com/d.betza/chessvar/16x
-- perl -e'print pack"H*","6e656d6f406d38792e6f7267"'
It's a very sad book in many ways- there was a lot of tension between certain members of the team and you realized that professional checkers was dying rapidly. Tinsley and Schaffer set up a world championship rematch between them (Tinsely won the first one) and Tinsely pulled out after six games saying he felt ill. He checked himself into the hospital, was diagnosed with some aggressive form of cancer and died a few months later. Schaeffer basically retired Chinook from human tournaments since nobody else was even remotely close to Tinsley.
It didn't make many headlines because everyone knows checkers is easy. Except that they are wrong- it's not.
"Seven Deadly Sins? I thought it was a to-do list!"
you didn't answer the question. How many gazillion?
-1 not first post
They randomise starting back-rank positions now in some tournaments, to stave off the eventual "book death" that has already conquered checkers.
I made up my own variation with randomness that I call Schrödinger's Chess.
Let me know if you try it out.
The day an automaton is "unbeatable" is the day it's 500ft tall and shoots nuclear rockets from its fingertips. I think I know a relatively easy way to beat this checkers program.
One can get much of the overall story online here.
Schrodinger's chess is when you set up a chess board in a box with a cat. You then shake the box, and declare that you beat the cat at chess.
Rampant carbon sequestration destroyed the Dinosaurs' tropical paradise. I'm here to help repair the damage.
Good idea. Perhaps Checkers can be revitalized by randomizing which piece goes on which starting space too...