Zobrist Hashing

Reading time: 15 minutes | Coding time: 5 minutes

Zobrist hashing (additionally alluded to as Zobrist keys or Zobrist marks ) is a hash function development utilized as a part of computer programs that play unique board games, for example, chess and Go, to execute transposition tables, an exceptional sort of hash table that is listed by a board position and used to abstain from examining a similar position more than once. Zobrist hashing is named for its creator, Albert Lindsey Zobrist.

This is a companion discussion topic for the original entry at http://iq.opengenus.org/zobrist-hashing-game-theory/