Re: "Solvability" in Chess

Article View: sci.logic

Article #389

#389

From: Tim W Smith
Date: Sun, 27 Sep 1992 20:22

17 lines
1202 bytes

> BUT!  If it can be proven that there is no possible way to represent
> the tree of all possible chess positions (really a graph, not a tree)
> because of its size and the Uncertainty Principle, I contend that chess 
> is not solvable by this method.  Conversely, if it can be proven that 
> there exists a way, however impractical, to represent this graph, then 
> chess is solvable by this method.  
> 
> I do not advance a proof for either side; I am merely pointing out
> what I feel is a flaw in your logic.

Do you also reject Euclid's (and others) proofs that there are an infinite
number of primes?  They contain the same "flaw" of logic. 

Besides, it is easy to represent the tree: Let T be the tree of all
possible chess games...

--Tim Smith

Technical Details

Message-ID: <66711@cup.portal.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!portal!cup.portal.com!ts

References: <1992Sep24.055117.13187@raven.alaska.edu> <xeno.717323625@pv34ad.vincent.iastate.edu> <19s2bbINNcqi@agate.berkeley.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!portal!cup.portal.com!ts
From: ts@cup.portal.com (Tim W Smith)
Newsgroups: sci.logic,sci.math,rec.games.chess
Subject: Re: "Solvability" in Chess
Message-ID: <66711@cup.portal.com>
Date: Sun, 27 Sep 92 13:22:24 PDT
Organization: The Portal System (TM)
References: <1992Sep24.055117.13187@raven.alaska.edu>
  <xeno.717323625@pv34ad.vincent.iastate.edu>
  <19s2bbINNcqi@agate.berkeley.edu>
Lines: 17

Reply to Parent Message