Author: Tom Kerrigan
Date: 18:15:26 01/24/02
Go up one level in this thread
On January 24, 2002 at 20:31:11, Dann Corbit wrote: >>0.4% and the chance it's in a 256k cache is 0.05%. Seems like the most it could >>speed your program up is 0.35%, and that's not taking into account the stuff >I suspect the relationship is not linear, but then again, hashing itself >scatters the data on purpose, so it might be. Exactly, one has to hope that it's linear. >>'Course, if you're doing very small searches, the hash table would fit in the >>cache and be accessed with relative frequency due to iterated searching, but I >>don't consider this a very interesting case. >True, but it will be a big help in some operations like EGTB lookup. I doubt if I'm not sure if it would be. If the hash table is being accessed way more frequently than the EGTB cache then it will push out the EGTBs. -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.