Entry »
New Scientist Tech » Checkers ‘solved’ after years of number crunching
This guy has a checkers engine that is unbeatable. He’s essentially proven that if two players don’t make any mistakes, checkers always ends in a draw just like tic tac toe. I wonder if they’ll ever prove the same about chess?
- 19 Jul 2007
- 3:06 pm
Tagged: algorithm, checkers, computer, cs, game, interpolation, new-scientist-tech, News, read, science
No responses »
Leave a response »
Line and paragraph breaks are automatic, your e-mail address will never be displayed, and the following XHTML tags are allowed:
<a href="" title=""> <abbr title=""> <acronym title=""> <blockquote cite=""> <code> <del datetime=""> <em> <h4> <ins datetime="" cite=""> <li> <ol> <strike> <strong> <ul>
Joey reserves the right to edit or remove your response and to censor rude or objectionable words and phrases.
