Computer Chess Club Archives




Subject: Re: is the

Author: Roberto Waldteufel

Date: 14:02:51 07/20/98

Go up one level in this thread

On July 20, 1998 at 15:20:24, Dan Newman wrote:

>On July 20, 1998 at 14:36:12, Bruce Moreland wrote:
>>On July 20, 1998 at 14:30:47, Dan Newman wrote:
>>>One of the biggest effects I see is that I get a much larger node rate
>>>the longer I run.  If I run a test for 10 s I might get 170 knps.  If
>>>I run for 40 s 200 knps.  It does level off of course.  I'm using a
>>>P6/200, so I've attributed this effect to improving branch prediction
>>>as the code runs.  Any ideas?
>>Maybe it has something to do with the deeper search having characterstics that
>>differ from the shallower search.
>I bet that's it or at least a lot of it.  The major difference is that
>the deeper plies will have fewer pieces on average.  So move generation
>will be a little cheaper, a smaller portion of the moves generated
>will be wasted, and so forth.

Have you considered that the deeper iterations contain the most transpositions,
so you will process more nodes quickly by hash table look-up? I think this must
surely account for at least some of the difference.

Best wishes,

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