Computer Chess Club Archives

Search

Messages

Subject: Re: Pawn hashing without Zobrist keys

Author: Vincent Diepeveen

Date: 07:10:17 09/13/03

Go up one level in this thread

On September 12, 2003 at 16:59:13, Dieter Buerssner wrote:

>On September 12, 2003 at 16:53:44, Omid David Tabibi wrote:
>
>>assuming 'table_size' is a power of 2, the following two expressions are
>>equivalent:
>>
>>address = key % table_size;
>>address = key & (table_size - 1);
>
>Omid, read over this thread, again. I think, there is no doubt, that Gerd is
>very well aware of the above. It seems, you are not aware of all the
>consequences (GCP gave you a hint).
>
>Regards,
>Dieter

I seriously doubt Gerd is aware how slow bitboards are and how difficult they
are to use in complex software to improve for example ones evaluation function.

Also i seriously doubt Gerd knows the penalty for % at the opteron.

Regards,
Vincent

• Re: Pawn hashing without Zobrist keys Gerd Isenberg 08:22:39 09/13/03
  • Re: Pawn hashing without Zobrist keys Vincent Diepeveen 16:43:33 09/13/03
    • Re: Pawn hashing without Zobrist keys Gerd Isenberg 01:48:48 09/14/03
      • Re: Pawn hashing without Zobrist keys Vincent Diepeveen 04:06:19 09/14/03
        • Re: Pawn hashing without Zobrist keys Gerd Isenberg 06:19:18 09/14/03
          • Re: Pawn hashing without Zobrist keys Vincent Diepeveen 06:45:19 09/14/03
        • typo Vincent Diepeveen 04:09:34 09/14/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.