Author: Tom Kerrigan
Date: 16:48:59 03/03/00
Go up one level in this thread
On March 03, 2000 at 16:31:45, blass uri wrote: >They are never empty if the program uses them but there is a time when they are >also not full. Actually, they are frequently empty. Right after you start the program, for example. When your hash table is full, that means it has a lot of positions in it, so it's arguably much more useful than when it's empty. (Or even not entirely full.) However, when it's completely full, you're probably putting in more positions than it can handle, so data is being lost (overwritten). Losing data is bad for your branching factor. But the hash table is still good, because it still has a whole bunch of positions in it. -Tom
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.