Computer Solves Checkers

[Easy Rhino]

Scientists at the University of Alberta report that their computer, codenamed Chinook, has solved the game of checkers. Since 1989 Chinook has been analyzing 500,000,000,000,000,000,000 positions and has concluded that if played perfectly the game will result in a draw. The scientists' work highlights raw computing power and the process of developing artificial intelligence to solve complex problems.

Source: Salon (http://machinist.salon.com/blog/2007/07/19/checkers/)

[OnBoard]

That's a lot of positions! Luckily I only know how to win tic tac toe every time, if I get to start in middle and opponent doesn't put first mark in corners (it's always draw too, if it's not done like that).

Oh and that's pretty impressive uptime :D They don't build 'em like they used to if it has all orginal parts : o

[nflesher87]

and how much money went into spending 18 years SOLVING CHECKERS?! :banghead:
:roll:

[Easy Rhino]

and how much money went into spending 18 years SOLVING CHECKERS?! :banghead:
:roll:

lol, well probably didnt cost too much since most university research is funded by grants from companies. regardless, just be happy they havnt bothered solving chess. apparently that is about 500,000,000,000,000,000,000,000,000,000,000,000,00 0,000,000 positions!!!!

[Cuzza]

So.... what's the answer? How do you play perfectly?

[Easy Rhino]

So.... what's the answer? How do you play perfectly?

well if you were to sit down and play chinook you couldnt beat it. you could only hope to force a draw because when played perfectly nobody wins. which means you have to play 1 specific way since chinook knows literally everything about checkers. one wrong move on your part and you lose since chinook will never make a bad move. so there is no one answer, but rather an algorithm that you use as a key. of course its extremely complicated since as the article says there are 500,000,000,000,000,000,000 positions.

[nflesher87]

well if you were to sit down and play chinook you couldnt beat it. you could only hope to force a draw because when played perfectly nobody wins. which means you have to play 1 specific way since chinook knows literally everything about checkers. one wrong move on your part and you lose since chinook will never make a bad move. so there is no one answer, but rather an algorithm that you use as a key. of course its extremely complicated since as the article says there are 500,000,000,000,000,000,000 positions.

exactly, though with each successive move that number will dwindle and you're chances of making an error decrease! haha too bad it would decrease insignificantly until the last move or two

[demonbrawn]

"That's right Chinook, king me."
"Oh, shucks." *Chinook laughs and flashes a sly grin*

[WarEagleAU]

Usually anyone who plays winds up drawing because you can get to one spot and move back and forth and they can never jump you. I hate when it does that...check out ms checkers and give it a whirl ,G>

[lemonadesoda]

I'm a genius and can do the chess analysis in my head. The answer is:

If both players play perfectly the game will end in a draw.

NO SHIT SHERLOCK

[Cuzza]

well if you were to sit down and play chinook you couldnt beat it. you could only hope to force a draw because when played perfectly nobody wins. which means you have to play 1 specific way since chinook knows literally everything about checkers. one wrong move on your part and you lose since chinook will never make a bad move. so there is no one answer, but rather an algorithm that you use as a key. of course its extremely complicated since as the article says there are 500,000,000,000,000,000,000 positions.

that doean't help MY play. ...... *currently rocking out to queen don't stop me now*.... don't stop me now cause i'm having a good time... don't wanna stop at all....da da da da da