Re: Why can't a machine be World's Checkers Champ?

Article View: net.chess

Article #849

#849

From: Bradford W. Miller
Date: Fri, 09 Aug 1985 19:51

14 lines
1276 bytes

In article <10913@rochester.UUCP> ray@rochester.UUCP (Ray Frank) writes:
>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.

If an algorithm exists that insures a win for the first player, checkers is
then not a game.

Brad Miller

-- 
..[cbrma, ccivax, ccicpg, rayssd, ritcv, rlgvax, rochester]!ccice5!ccice1!bwm

Technical Details

Message-ID: <357@ccice1.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!linus!philabs!cmcl2!seismo!rochester!ritcv!ccice5!ccice1!bwm

References: <474@oakhill.UUCP> <10913@rochester.UUCP>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ccice1.UUCP
Path: arc1-ca.pugleaf.net!utzoo!linus!philabs!cmcl2!seismo!rochester!ritcv!ccice5!ccice1!bwm
From: bwm@ccice1.UUCP (Bradford W. Miller)
Newsgroups: net.chess
Subject: Re: Why can't a machine be World's Checkers Champ?
Message-ID: <357@ccice1.UUCP>
Date: Fri, 9-Aug-85 15:51:37 EDT
Article-I.D.: ccice1.357
Posted: Fri Aug  9 15:51:37 1985
Date-Received: Mon, 12-Aug-85 08:15:24 EDT
References: <474@oakhill.UUCP> <10913@rochester.UUCP>
Reply-To: bwm@ccice1.UUCP (Bradford W. Miller)
Organization: CCI Central Engineering, Rochester, NY
Lines: 14

Reply to Parent Message