Author: Robert Hyatt
Date: 15:10:56 09/08/03
Go up one level in this thread
On September 08, 2003 at 18:02:06, Russell Reagan wrote: >Is there any way to hash a 64-bit bitboard containing any number of 1-bits? I am >aware of minimal perfect hash function that will work with bitboards containing >a single 1-bit (using de Bruijn sequences), and there is a non-minimal method >for bitboards containing two 1-bits (similar to the de Bruijn method), but I am >not aware of any hash function that will generate a hash key, given a bitboard >containing any number of 1-bits. > >Does anyone know how this might be accomplished? Hashing is not exact, as it is a many-to-one mapping function. You can devise most any sort of approach you want. Mod(). folding/XORing. Etc.
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.