Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Jonathan Schaeffer
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Draughts: Chinook== {{main|Chinook (computer program)}} Chinook is the first [[computer program]] to win the world champion title in a competition against humans. In 1990 it won the right to play in the human World Championship by being second to [[Marion Tinsley]] in the US Nationals. At first the [[American Checker Federation|American Checkers Federation]] and English Draughts Association were against the participation of a computer in a human championship. When Tinsley resigned his title in protest, the ACF and EDA created the new title Man vs. Machine World Championship, and competition proceeded. Tinsley won with four wins to Chinook's two. In a rematch, Chinook was declared the Man-Machine World Champion in checkers in 1994 in a match against Marion Tinsley after six drawn games, and Tinsley's withdrawal due to pancreatic cancer. While Chinook became the world champion, it had never defeated the best checkers player of all time, Tinsley, who was significantly superior to even his closest peer. The championship continued with Chinook defending its title against [[Don Lafferty]] when it lost one game, won one and drew 18. After the match, Jonathan Schaeffer decided not to let Chinook compete anymore, but instead try to [[solve game|solve]] checkers. It was rated at 2814 [[Elo rating system|Elo]]. In 2007, after 18 years of computation, he proved through a [[solved game|weak solution]] that checkers always results in a draw if neither player makes a mistake. The solution involved 10<sup>14</sup> calculations from endgame positions with fewer than 10 pieces on the board.<ref>{{cite web | url=https://www.newscientist.com/article/dn12296-checkers-solved-after-years-of-number-crunching.html | title=Checkers 'solved' after years of number crunching | date=2007-07-19 | accessdate=2007-07-20 | publisher=NewScientist.com news service | first=Justin | last=Mullins | archive-date=2009-05-22 | archive-url=https://web.archive.org/web/20090522102738/http://www.newscientist.com/article/dn12296-checkers-solved-after-years-of-number-crunching.html | url-status=live }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)