The Hashtable Packing Problem (2020)
a year ago
- #chess
- #NP-complete
- #optimization
- The Hashtable Packing Problem is part of a project to optimize bitboard-based move generation in chess.
- The problem is proven to be strongly NP-complete, making optimal solutions impractical.
- Definitions include a Hashtable as a list of integers representing occupied and empty buckets.
- A Hashtable Packing involves arranging multiple hashtables in memory without overlapping occupied buckets.
- The problem is reduced to the 3-Partition Problem, which is strongly NP-complete.
- Magic Bitboards in chess involve optimizing hashtables for piece attacks, which is complex and intertwined.
- Due to NP-completeness, optimal solutions for Magic Bitboards are impractical, suggesting the use of heuristics.