Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bds beta 6/6/85; site pucc-h
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!ihnp4!inuxc!pur-ee!pucc-j!pucc-h!ags
From: ags@pucc-h (Dave Seaman)
Newsgroups: net.games.chess
Subject: Re: Perfect Play?
Message-ID: <2746@pucc-h>
Date: Fri, 28-Mar-86 09:10:39 EST
Article-I.D.: pucc-h.2746
Posted: Fri Mar 28 09:10:39 1986
Date-Received: Tue, 1-Apr-86 07:33:16 EST
References: <2916@sunybcs.UUCP> <5112@alice.uUCp> <39@paisley.ac.uk>
Reply-To: ags@pucc-h.UUCP (Dave Seaman)
Organization: Purdue University Computing Center
Lines: 12

In article <39@paisley.ac.uk> rh@cs.paisley.ac.uk (Robert Hamilton) writes:
>Ie from an move 1 tere MUST be a forced win for white or a forced
>draw for black.
>The question : IS THERE ?
>If there is not I think that chess might be considered non-deterministic
>in the sense that the only analysis possible is heuristic.

In tic-tac-toe there is no forced win for the first player or the second.
Are you claiming that tic-tac-toe might be considered non-deterministic
in the sense that the only analysis possible is heuristic?
-- 
Dave Seaman	  					pur-ee!pucc-h!ags