Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Tony Werten

Date: 12:33:54 05/02/01

Go up one level in this thread


On May 02, 2001 at 11:46:52, Paul wrote:

>On May 02, 2001 at 11:42:22, Gian-Carlo Pascutto wrote:
>
>>On May 02, 2001 at 11:37:02, Paul wrote:
>>
>>>I also use nodecounts after reading about it on CCC. But what type do you use
>>>for the counter, an unsigned int? That will overflow after a search of a couple
>>>of hours on these 1M node/s machines we have nowadays, wouldn't it? Or am I
>>>missing something (like a shift right)?
>>
>>Shifting right sounds like a good idea, but it won't help if your
>>nodecounter itself also overflows of course.
>>
>>I had a similar problem when moving from a Cyrix120 to an Athlon 1000...
>>mynodecounts started getting higher than my 'infinite' value.
>>
>>--
>>GCP
>
>Right ... not surprisingly, I've had exactly the same problem! :) So what did
>you do to solve this? Use a double or a 64 bit int?

When you finish an iteration, first swap the bestmove to the front, then sort
the rest from the second position. Not a big change the second best move got an
overflow.

Tony

>
>Paul



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.