Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: pruning vs extensions vs qsearch - are these all effectively the same?

Author: Richard Pijl

Date: 07:49:00 11/27/02

Go up one level in this thread


On November 27, 2002 at 10:01:02, David Rasmussen wrote:

>Some time ago, along the lines of these thoughts, I proposed "negative
>extensions". That is, if you can somehow classify a move as "probably not
>interesting", you can "extend" the depth by -1 or -0.75 or whatever seems
>reasonable. Exactly as you do with normal extensions. The good thing about this
>is that nothing gets pruned for good, everything will eventually get searched
>with iterative deepening, but you search what you think is interesting first.

Isn't this just razoring?

IIRC Beowulf is using this instead of futility pruning ...

Richard



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.