Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Robert Hyatt

Date: 11:30:58 05/02/01

Go up one level in this thread


On May 02, 2001 at 12:53:04, Steffen Jakob wrote:

>On May 02, 2001 at 11:21:48, Robert Hyatt wrote:
>
>>
>>Mine is easy to do... and dates back to the early days of Cray Blitz, so it
>>has been tested quite extensively...
>>
>>I save the nodes searched for each root move.  For the PV move (the best move
>>after iteration N) I set its node count to something larger than any other move,
>>then I simply sort on node counts.  This puts the PV from iteration N-1 first
>>when we do iteration N.  If you change your mind at N-1 once, then the original
>>best move plus the new best move will have the two highest node counts and they
>>will be first.  Etc.
>
>Do you use the node count from the last iteration or do you compute the sum of
>all previous iterations? At the moment I only use the last iteration but think
>about to use the sum (although I dont think that it´ll make a big difference).
>
>Greetings,
>Steffen.


Last iteration only...

But it shouldn't really matter since the last iteration node counts are at
least 3x the previous iteration counts.  The last value would swamp older
values anyway.



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.