Author: Pete Galati
Date: 20:27:12 08/10/99
Go up one level in this thread
On August 10, 1999 at 22:18:22, Tina Long wrote: >Hi guys, >I remember Komputer Korner & others discussing this a year or so ago. > >I believe there was some concensus around the result approximating: > >"Once the hash tables are full, the time taken to reach a certain depth of >search is 20% longer than if the hash table wasn't full." > >I'd appreciate hearing thoughts on this. > >Thanks >Tina Long It's probably not the proper way to do it, but if computer starts making that obnoxious chatter sound then I know I've got the hashtables set too high, so I turn them down. For me it's that easy. I don't really care HOW much it's hurting the performance, the point is that it IS hurting the performance, and besides I don't want to listen to my harddrive. Pete
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.