Pawn Hash Table

Home * Evaluation * Pawn Structure * Pawn Hash Table

Pawns threaten the King [1] A Pawn Hash Table is often used inside a chess programs to cache purely pawn related pattern and evaluation stuff. Compared to the main transposition table, since the pawn structure inside the search changes rarely or transpose, the number of cached entries required might be quite low (a few K) to get a sufficient hit rate above 95% or even 99% for most positions, specially if the pawn structure is settled or relatively fixed after the opening. On the other hand, most programmers store not only pure aggregated pawn evaluation scores, but other computation expensive pawn structure stuff which is used in second pass evaluation considering pieces and king. Terms for various game phases and king origins for all possible wings/center per side are often calculated speculatively, i.e. pawn shield or pawn storm stuff later used by king safety.

While the content of the pawn hash table entry varies a lot between different chess programs and their implementation, it is not uncommon that one entry exceeds 1/2 K-Byte. Some programs store sets or bitboards of strong pawns ( passers, candidates), square of most advanced passer, different kind of weak pawn sets and whatever else. Despite, some programs cache pawn-king stuff separately which requires king squares included inside the index calculation as well table entry for verifications.

See also

Forum Posts

1999

2000 …

2005 …

2010 …

2015 …

References

  1. Chess Woodcuts Graphic Arts Woodcut Art by Elke Rehder
  2. Pawn hashing without Zobrist keys by Gerd Isenberg, CCC, September 12, 2003

Up one level