Author: John Coffey
Date: 15:16:31 09/16/98
Do programs use hash tables become they spend more time evaluating the positions at the leaves than they do traversing the tree? How much overhead (CPU wise) do hash tables take? It seems to me that in the endgame you could have the same positions arise multiple times, but in the middle game it would be rare. Has anyone done any tests on this? John Coffey
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.