Author: Bas Hamstra
Date: 06:07:48 07/25/02
Go up one level in this thread
On July 25, 2002 at 00:14:19, Robert Hyatt wrote: >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 is not a huge thing. It mainly helps where you fail high but can't get >a real score so that the next iteration, you end up with no hash moves for >the PV search... IID will supply good moves. All you get is a reasonable move from a D-2 search. Why not store the original hashmove in stead? So when you normally store a UPPER score, in stead of saving no move at all, you save the original hashmove? I don't see why IID would provide a better move than that... Best regards, Bas.
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.