Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The game of chess can never ever be solved.

Author: Sune Fischer

Date: 09:17:36 11/03/02

Go up one level in this thread


On November 03, 2002 at 12:01:08, Omid David wrote:
>>>>
>>>>Sure it can, it can find the solution at runtime by search.
>>>>
>>>
>>>Yes, but here we are talking about a problem that cannot be solved by runtime
>>>search.
>>
>>Never say never, it cannot be solved by search _now_, but who can possibly
>>imagine what kind of computational power we have in 5000 years?
>>
>
>Practically speaking, 5000 years is "never" for many of us...!

"Practically" we agree, for whether it's a 100 years or 5000 years, it won't be
in our lifetime. Also 100 years is "never" to most people, so I sort of assumed
time wasn't the issue here. A lot of things will be impossible to do within the
next 100 years, things that aren't considered impossible in general.

Anyway, guess the point was that the number of atoms is irrelevant, time is all
we need and I believe we have a few billion years until the Sun burn out, by
then we can probably move to a different solar system and continue the
calculation.. ;)

-S.



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.