Computer Chess Club Archives

Search

Messages

Subject: Re: Checks in the Qsearch

Author: Steve Maughan

Date: 13:24:32 07/08/02

Go up one level in this thread

Christophe,

[SNIP]

>It doesn't matter to what depth you are searching.
>
>Increasing R can in the best case only give a minor speedup.
>
>The speedup you can get by increasing R is bounded to a few percent.
>
>Just evaluate the time you are spending in null move searches currently.

[SNIP]

Is this really true.  I would say that to measure this you'd need to see what
percentage of leaf nodes have one or more null moves in their path.  I'd be
surprised if it were only a few percent.

Regards,

Steve

• Re: Checks in the Qsearch Christophe Theron 00:32:34 07/09/02
  • Re: Checks in the Qsearch Robert Hyatt 10:35:48 07/09/02

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.