Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: reducing null-move searches

Author: Ulrich Tuerke

Date: 06:09:22 11/17/97

Go up one level in this thread


Hi Alessandro !

I don't understand your remarks. When you consider to generate a null
move, your search must be in the full region ("depth > 1"). Standard
programs don't evaluate in this region (but leaves only). So you can't
compare with beta, unless you evaluate all nodes, which is presumably
quite expansive. On the other hand, when you are doing quiescence search
score >= beta leads to a cut anyway ("fail high"); so no further pruning
necessary. What did I get wrong ?

Regards, Uli



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.