Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hyatt vs corbit solving chess

Author: Robert Hyatt

Date: 11:09:52 01/23/05

Go up one level in this thread


On January 22, 2005 at 14:59:49, Duncan Roberts wrote:

>On January 21, 2005 at 22:50:08, Dann Corbit wrote:
>
>>http://www.chessbase.com/newsdetail.asp?newsid=1558
>
>
>I assume you know this.
>http://www.chessbase.com/newsdetail.asp?newsid=1563
>
>btw you once said it may be possible to solve chess with 50 ? acres of hard
>drive. ? (possible one or 2 other caveats as well)
>
>I would like to get feedback from hyatt on this as he seems to require a few
>galaxies. would you be able to repeat the calculation, so Prof Hyatt can respond
>
>duncan


I don't see what needs a response, that link is a joke of course.

Chess is solvable.  Will it be solved?  Who knows.  I go by the "never say
never" approach since "never" is a long time.  I can say "not in my lifetime"
with great certainty however.  Perhaps even "not in my kid's lifetime".  But
with a finite game, "never" is the wrong word..



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.