Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site rochester.UUCP
Path: utzoo!linus!philabs!cmcl2!seismo!rochester!ray
From: ray@rochester.UUCP (Ray Frank)
Newsgroups: net.chess
Subject: Re: Why can't a machine be World's Checkers Champ?
Message-ID: <10913@rochester.UUCP>
Date: Wed, 7-Aug-85 12:18:51 EDT
Article-I.D.: rocheste.10913
Posted: Wed Aug  7 12:18:51 1985
Date-Received: Sat, 10-Aug-85 21:57:07 EDT
References: <474@oakhill.UUCP>
Organization: U. of Rochester, CS Dept.
Lines: 15

> Scientific American a few months ago had an article about checkers strategy.
> Having done a chess program at first glance it seemed to me that checkers
> should be so much simpler than chess that a machine should certainly be
> ranked as among the world's best, if not world champion.
> 
I'm almost sure that a few years ago I read that man could no longer beat
a checker program.  And the only way even the world champ could win a game
was if the computer always moved second.  If the computer was aloud to move
first then it could ALWAYS win.  I'm talking main frame well done checker
programs here, not a radio shack toy.
This may clear up why a machine cannot be World's Checker Champ.  It could neverbe dethroned and thus would eliminate the world championship as an event.  I
think that checker programs for this reason may not be aloud to play tournament
checkers.  The USCF has considered outlawing chess programs before they have
a chance to be a world champ, but so far they are permited to enter most 
tournaments.  Usually at the discretion of the tournament director.