Author: Federico Corigliano
Date: 15:51:43 12/10/02
Hello Mi chess program uses a structure for the hash entry of 24 bytes. If I need to use 8 MB for the hash table, then I have two options: - Set the number of entries in power of two (262144 * 24 = 6291456 bytes) - Set the number of entries: (8*1024576)/24 = aprox. 340000 entries The second fill more the space asked, but I read that hashtables in power of two are more efficient. What do you recommend me? Federico Corigliano PS: Sorry but my poor english
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.