Author: Dave Gomboc
Date: 00:05:35 02/06/00
Go up one level in this thread
On February 05, 2000 at 20:42:26, Christophe Theron wrote: >Due to how hash tables are used by everybody, commercial programmers have found >how to use them very well, and I don't think anybody uses it much better than >his peers. Even if no one is using it much better than anyone else, it doesn't follow that they're all using it in more or less the same way. Concrete example: mtd() methods will choke bigtime if the hash table is insufficiently large. A 16 Mb table might cut it for a game, but a 4 Mb table might just kill the algorithm completely (except for blitz chess). On the other end of the scale, if 2 Gb of memory is available, some algorithms might make use of additional stored information in each table entry, rather than simply having a larger number of table entries, or larger table buckets. IMO, this is a place where some research might be worthwhile. For sure, at least some small stuff in this area is already being done. I think Ed even admitted it once (regarding the jump from 28Mb to 60Mb in Rebel). Dave
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.