chess:programming:hash_functions
This is an old revision of the document!
Chess - Programming - Hash Functions
Hash functions convert chess positions into an almost unique, scalar signature, allowing fast index calculation as well as space saving verification of stored positions.
Common Hash Functions are:
NOTE: They use fast hash functions, to provide hash keys or signatures as a kind of Gödel number of chess positions, today typically 64-bit wide.
- They are updated incrementally during make and unmake move by either own-inverse exclusive or or by addition versus subtraction.
chess/programming/hash_functions.1634035808.txt.gz · Last modified: 2021/10/12 10:50 by peter