Computer Chess Club Archives


Search

Terms

Messages

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

Author: Robert Hyatt

Date: 14:24:09 04/26/01

Go up one level in this thread


On April 26, 2001 at 16:57:53, Christophe Theron wrote:

>
>
>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.
>
>
>
>    Christophe


Maybe that was Hsu's point.  At 200M nodes per second you probably won't
get outsearched if you search every node twice.  :)



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.