Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What means lazy/plain alpha bounding?

Author: Heiner Marxen

Date: 13:33:25 02/07/01

Go up one level in this thread


On February 07, 2001 at 16:22:12, Severi Salminen wrote:

>Hi!
>
>Thanks for detailed explanation.
>
>>1.  You might start the next iteration without a PV to guide the search.
>>Internal iterative deepening helps.
>
>Oh, a new term again: internal iterative deepening. I think this was the thing I
>wondered in Crafty's search.c. Do you use IID in other places than when you are
>in PV node and don't have a move to try? Has anyone ever tried to use IID in
>_every_ node?

Chest does that.  But you did not want to know that, I suspect ;-)

>If it helps in the root why wouldn't it help in other nodes as well...

IID can be a considerable overhead.  You better have a good reason to do it.
What does IID give you?  A good move ordering.  If you do not believe
that your move ordering must be improved (at a certain node), then there
is not much gained by IID.

A missing PV seems to be a good reason to do IID.

Heiner



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.