Talk:Zobrist hashing

From Wikipedia, the free encyclopedia

This article is within the scope of WikiProject Go, a collaborative effort to improve Wikipedia's coverage of the game of Go. If you would like to participate, you can visit the project page, where you can join the project and see a list of open tasks.
??? This article has not yet received a rating on the quality scale.
??? This article has not yet received a rating on the importance scale.
This article is within the scope of WikiProject Chess, a collaborative effort to improve Wikipedia's coverage of chess. For more information, visit the project page, where you can join the project and/or contribute to the discussion.
Start This article has been rated as Start-Class on the quality scale.
Low This article has been rated as Low-Importance on the importance scale.

Zobrist hashing was originally invented for computer chess and is the most popular hash method there. For chess you need 13 different values (for 6 piece types for each side, or an empty square) at each square. In addition it is best to hash in the castling and en-passent status as well. All this makes it a bit more complicated than for go, but still quite manageable. There are the same benefits, in that it is very efficient to incrementally update the hash value after making a move: only the squares affected need their contributuitions recalculated rather than the whole board. 198.142.44.32 00:37, 23 March 2007 (UTC)