Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Internal Iterative Deepening

Author: Georg v. Zimmermann

Date: 04:28:28 07/25/02

Go up one level in this thread


On July 24, 2002 at 22:00:04, Matthew McKnight wrote:

>IID seems to give me a lower node count at some plies, but a higher one at
>others.  Is this just because IID doesn't give a huge speedup or does it mean
>that I am implementing it incorrectly?
>
>Matt

IID does make your program use smaller windows more often, so all the program
characteristics which hurt programs using lots of/only null window searches (for
example MTD) will hurt you too.
That is extensions very dependent on window, unstable eval (big changes between
similar positions), generally big score changes. ...

Regards,
Georg



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.