Article View: net.games.chess
Article #311Re: Deterministic Chess (Re: Perfect Play?)
From: Andrew Koenig
Date: Fri, 21 Mar 1986 03:59
Date: Fri, 21 Mar 1986 03:59
7 lines
960 bytes
960 bytes
> 1. Since there is no way we will ever be able to fully analyze > chess, is it possible nonetheless to determine the PROBABILITY > of BLACK having a forced win from the opening position? > (The same goes for a forced DRAW or for a forced WHITE win.) I don't know what this question means. Either black has a forced win or black doesn't. The probability is either 1 or 0.
Technical Details
Message-ID:
<5149@alice.uUCp>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!burl!ulysses!bellcore!petrus!scherzo!allegra!alice!arkReferences:
<912@whuxlm.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.1 6/24/83; site alice.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!burl!ulysses!bellcore!petrus!scherzo!allegra!alice!ark From: ark@alice.UucP (Andrew Koenig) Newsgroups: net.games.chess Subject: Re: Deterministic Chess (Re: Perfect Play?) Message-ID: <5149@alice.uUCp> Date: Thu, 20-Mar-86 22:59:32 EST Article-I.D.: alice.5149 Posted: Thu Mar 20 22:59:32 1986 Date-Received: Sat, 22-Mar-86 04:08:29 EST References: <912@whuxlm.UUCP> Organization: Bell Labs, Murray Hill Lines: 7