Computer Chess Club Archives




Subject: Re: When to RecordHash()?

Author: Robert Hyatt

Date: 19:53:40 12/26/01

Go up one level in this thread

On December 26, 2001 at 10:50:34, Sune Fischer wrote:

>On December 26, 2001 at 10:13:48, Robert Hyatt wrote:
>>It will _bury_ you if you do aspiration search at the root.  IE you don't
>>start with +/- infinity, but some narrower window.  If your window is too
>>"high" you will fail low at the root and you won't have any move from the
>>hash table.
>I know it is slow, but I want the simpler stuff to work before I increase
>complexity :)
>> But in my case this isn't a problem since I don't probe the
>>hash table at the root anyway...
>Oh, why not?
>Don't you use it for moveordering?

At the root?  Why?  You _know_ the best move to try.  That is the best
move from the previous iteration.  I keep a long-lived root-move-list that
I order as needed, but the best move from the previous iteration is _always_
at the top.

This page took 0.02 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.