Sciweavers

Share
ICGA
2008

Move Generation with Perfect Hash Functions

8 years 2 months ago
Move Generation with Perfect Hash Functions
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bitboards. Moreover, we show that simple variations of these schemes give minimal perfect hashing schemes. The new method is applicable provided N, the number of k-bit spaced positions
Trevor I. Fenner, Mark Levene
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where ICGA
Authors Trevor I. Fenner, Mark Levene
Comments (0)
books