Abstract
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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have