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

• Type: Journal
• Year: 2008
• Where: ICGA
• Authors: Trevor I. Fenner, Mark Levene
• Keywords: Chess-like Board Games, ICGA 1997, ICGA 2008, Minimal Perfect Hashing, Perfect Hashing Schemes