Computer Chess Club Archives

Search

Messages

Subject: Re: What is the public's opinion about the result of a match between DB and

Author: Uri Blass

Date: 14:25:12 04/26/01

Go up one level in this thread

On April 26, 2001 at 16:57:53, Christophe Theron wrote:
<snipped>
>If it is just that, then there are ways to avoid these problems. Expensive, but
>less expensive than brute force.
>
>The problem I abhor is when my program gets oursearched. This by far outweigths
>any other minor problem. Brute force always has this problem, not just in one
>game out of 1000.

I agree.

If they care about errors there are other possible errors that prevent chess
program to solve chess even if the hardware is
999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999

times faster

1)hash collision
2)limited depth(some programs cannot search more then X plies and the time
control is not relevant).

Uri

• Re: What is the public's opinion about the result of a match between DB and Christophe Theron 16:11:50 04/26/01

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.