Computer Chess Club Archives

Search

Messages

Subject: Re: hash table size - is a power of 2 still an advantage these days?

Author: Sune Fischer

Date: 13:38:16 09/24/03

Go up one level in this thread

On September 24, 2003 at 15:49:15, Uri Blass wrote:

>Did you compare speeds to find out that it is 0.05%?
>I suspect that it is clearly bigger than it.

The modulo is a binary operator, I would not expect it to take hundreds of
clocks.
It's about the same speed as a division IIRC, (you don't need the full fraction,
only the remainder).

But more importantly, it's a design decision to limit the programs capabilites
in this way. I prefer to let the user (incl. myself) make use of *all* the
memory, afterall I didn't put 512 MB of memory in my machine to run with a mere
256 MB of hash! :)

Of course it matters most when doing long analysis, not very important for blitz
games.

-S.

>Uri

• Re: hash table size - is a power of 2 still an advantage these days? Uri Blass 14:37:06 09/24/03
  • Re: hash table size - is a power of 2 still an advantage these days? Sune Fischer 15:47:34 09/24/03
  • Re: hash table size - is a power of 2 still an advantage these days? Sune Fischer 15:00:09 09/24/03
    • Re: hash table size - is a power of 2 still an advantage these days? Uri Blass 15:52:10 09/24/03
      • Re: hash table size - is a power of 2 still an advantage these days? Sune Fischer 16:15:33 09/24/03

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.