Author: Robert Hyatt
Date: 13:44:17 08/19/99
Go up one level in this thread
On August 19, 1999 at 16:37:42, Bruce Cleaver wrote: >All - > >I have been reading CCC for some months now, and have seen discussions to the >effect that you can set your hash table size TOO large. It will inhibit >performance, especially in speed games (i.e., there is an optimal size and more >is not necessarily better). Can anyone explain to me why this is so? > >Thanks in advance, > >Bruce The only issues are this: (1) If you set them too large, you can start paging to disk, which is going to kill performance. You should _never_ go this large. IE the largest you can use without paging (disk i/o access light _off_ all the time) is the biggest practical size. (2) If the program you use clears the hash table between searches, then a large table (in blitz games) can be bad, because it might take longer to clear a huge hash table than it does to search for a fraction of a second. For programs that don't clear the hash table (Crafty doesn't, but I don't know a thing about what other programs do) this isn't an issue... and for Crafty, all you have to worry about is not violating (1) above...
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.