Get the latest tech news
The Hashtable Packing Problem (2020)
part of my project aiming to - establish theoretical limits for bitboard based move generation in chess and similar games - get as close to them as practically possible. The Hashtable Packing Problem is an optimization problem encountered when tuning Magic Bitboards in chess.
establish theoretical limits for bitboard based move generation in chess and similar games get as close to them as practically possible. This may be interesting, because unary encoding closely resembles the memory representation typically used when validating magic factors. We can conclude that an optimal solution cannot efficiently be obtained by decomposing the problem and abstractly working with the resulting hashtables.
Or read this on Hacker News