Computer Chess Club Archives

Search

Messages

Subject: Re: Data on hash table probing and memory bandwidth

Author: Robert Hyatt

Date: 11:51:18 12/16/02

Go up one level in this thread

On December 16, 2002 at 13:32:46, Dieter Buerssner wrote:

>I did similar tests. IIRC, I got differences of > 5% faster for, what you called
>"new". I unfortunately do not have the code for the "old" (2 different tables)
>handy anymore, to recheck. You are not probing in quiescence search, so it is
>reasonable to expect, that your differences are smaller.
>
>Anyway, for a very small code change (I would guess not more than 1 hour),
>getting 5% is not so bad.
>
>Regards,
>Dieter


No, although for me it was 2% which is not so hot...

I will probably stick with it since it is done, of course....

• Re: Data on hash table probing and memory bandwidth Miguel A. Ballicora 13:03:11 12/16/02
  • Re: Data on hash table probing and memory bandwidth Robert Hyatt 13:31:21 12/16/02
    • Re: Data on hash table probing and memory bandwidth Matt Taylor 17:32:17 12/16/02
      • Re: Data on hash table probing and memory bandwidth Robert Hyatt 20:06:28 12/16/02

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.