Author: Scott Gasch
Date: 22:37:29 10/09/02
Go up one level in this thread
On October 09, 2002 at 17:21:27, Mustafa wrote: >can someone please tell me what really eval hash means? I would guess that "eval hash" refers to a hash table where you store full position evaluation of leaf nodes in the search... i.e. when you evaluate a position you put the final score in the eval hash, before you evaluate a new one you check the eval hash to see if it's already in there and you can save work. This "eval hash" may or may not be a different data structure than the traditional hash table where you store info about all search tree nodes and may store bound information instead of precise evaluation scores. I've played with eval hash a little in my own engine... which spends approx 40% of its time in eval at last profile... Scott
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.