Author: Sune Fischer
Date: 05:56:30 12/05/01
Go up one level in this thread
On December 05, 2001 at 08:22:40, Gerd Isenberg wrote:
>About the pawn hash key discussions: Why using Zobrist keys for pawn hashing at
>all, at least in BitBoard programs? Isn't it smarter to use a unique 46 Bit
>(Rank2-7) Difference of two colored Pawn-BitBoards instead of zobrist keys for
>pawns? No key collisions and key and index (key mod nEntries) calculation on the
>fly.
I don't think it would be faster, the pawn key is also found on the fly by
incremental update when you move or capture a pawn.
But how will you mask the three choices: {white pawn, black pawn, empty square}
onto a key with 0-1 values?
Have you created a function for that, is it fast?
-S.
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.