Difference between revisions of "Evaluation Hash Table"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Evaluation * Evaluation Hash Table''' An '''Evaluation Hash Table''' may be used in a similar fashion as the Transposition Table|transposition t...")
 
Line 17: Line 17:
 
* [http://www.talkchess.com/forum/viewtopic.php?t=58758 crafty eval cache] by [[Alvaro Cardoso]], [[CCC]], January 01, 2016 » [[Crafty]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=58758 crafty eval cache] by [[Alvaro Cardoso]], [[CCC]], January 01, 2016 » [[Crafty]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=59566 hash eval, hash pawn or twice ?] by [[Daniel Anulliero]], March 19, 2016 » [[Pawn Hash Table]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=59566 hash eval, hash pawn or twice ?] by [[Daniel Anulliero]], March 19, 2016 » [[Pawn Hash Table]]
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=70938 Using evaluation hash score as current bestscore (initial guess)] by [[Vivien Clauzon]], [[CCC]], June 06, 2019
  
 
'''[[Evaluation|Up one level]]'''
 
'''[[Evaluation|Up one level]]'''

Revision as of 09:55, 7 June 2019

Home * Evaluation * Evaluation Hash Table

An Evaluation Hash Table may be used in a similar fashion as the transposition table, that is using Zobrist- or BCH-hashing, to cache various computational expensive positional evaluation scores and flags. Despite the fact that the transposition table entries may contain evaluation scores as well, a tighter, dedicated evaluation hash table with its own replacement policy may gain a considerable amount of additional hits.

See also

Forum Posts

Up one level