The hash updates incrementally on each move (no need to rehash the entire board), making it essentially free. 1M Entry Hash Table — A 2^20 entry table indexed by bitwise masking. Stores the score, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results