Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What do programmers think about a chess algorithm??

Author: Dann Corbit

Date: 16:54:24 12/10/02

Go up one level in this thread


On December 10, 2002 at 19:46:44, Uri Blass wrote:
[snip]
>I do not believe that it is possible to solve it with the hardware of today so
>I am not going to try.
>It is not a proof that it is impossible to solve it.

Suppose that you claim a mate in n.  In what way will you prove it?

I will take an opponent position with a different result.  You will have to
prove it is unreachable.

There is no way to do that without solving the nodes of the tree.

Consider some mate in n claim that you make.  I show you a game between two
superGM's that follows a different path.  You will have to prove that each of
the nodes is unreachable by an opponent.

There is no way to do that without solving the nodes of the tree.

It seems very clear to me.



This page took 0.01 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.