Admin: Created page with "'''Zobrist hashing''' (also referred to as '''Zobrist keys''' or '''Zobrist signatures''' ) is a hash function construction used in computer programs that play abstr..."

2019-02-26T05:57:48Z

Created page with "'''Zobrist hashing''' (also referred to as '''Zobrist keys''' or '''Zobrist signatures''' ) is a hash function construction used in computer programs that play abstr..."

New page

'''Zobrist hashing''' (also referred to as '''Zobrist keys''' or '''Zobrist signatures''' ) is a [[hash function]] construction used in [[computer program]]s that play [[abstract board game]]s, such as [[computer chess|chess]] and [[computer go|Go]], to implement [[transposition table]]s, 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 Lindsey Zobrist (computer scientist)|Albert Lindsey Zobrist]]. It has also been applied as a method for recognizing substitutional alloy configurations in simulations of crystalline materials.

==See also==
* [[Alpha-beta pruning]]

==Source==

[http://wikipedia.org/ http://wikipedia.org/]
[[Category:Cryptocurrency news]]

Zobrist hashing - Revision history

Admin: Created page with "'''Zobrist hashing''' (also referred to as '''Zobrist keys''' or '''Zobrist signatures''' ) is a hash function construction used in computer programs that play abstr..."