Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: When to do a null move search - an experiment

Author: Uri Blass

Date: 08:01:55 04/28/04

Go up one level in this thread


On April 28, 2004 at 10:41:04, Uri Blass wrote:

<snipped>
>Of course my program is different and I do not use hash for pruning but
>I see advantage of not using hash for pruning and the main advantage is that you
>have more freedom in the evaluation function and I can let myself to have
>evaluation that is dependent not only on the leaf position.
>
>Uri

Only to make things clear when I say evaluation that is not dependent only on
the leaf position I do not mean to root processors that change their static
evaluation when the root position is changed.

I mean that the same position may be evaluated different in the same search.

An example is to have evaluation closer to a draw if you suspect perpetual check
based on the fact that the inferior side gave many checks.

You can get the same position also without many checks and in this case my
evaluation is different.

Uri



This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.