Author: Dann Corbit
Date: 17:16:29 01/18/99
Go up one level in this thread
How do you decide how wide to make the hash and how deep to make the table for a given available total memory size? Obviously we could choose to make the entire table, within the nearest power of 2, map directly to a hash. Or we could have 8 hash values and super-deep lists. Obviously both of these would be stupid. So what is smart?
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.