Zobrist hashing - Wikipedia

Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures [1]) is a hash function construction used in computer programs that play abstract board games, such as chess and Go, to implement transposition tables, a special kind of hash table that is indexed by a board position and used to avoid analyzing the same position more than once. Zobrist hashing is named for its inventor, Albert

[yowa]

各駒の位置に対応したhashを全てXORすることで局面のhashを生成。手順を辿るのが楽。同一局面なら（手順が違っても）同一hash値になる。（衝突の評価が難しい？）