Author: Dave Gomboc
Date: 16:58:28 10/10/99
Go up one level in this thread
On October 10, 1999 at 15:50:55, Daniel Karlsson wrote: >On October 09, 1999 at 02:17:48, Scott Gasch wrote: > >>(that's 66 bytes because of the sizeof(move)). My hash is an array of 500k of >>these (actually 500069 because it's a prime close to 500k) > >Just curious - why a prime? Good question. We always refer to it as a "hash table", but really we (generally) use a "cache table", and aren't performing quadratic chaining or double-hashing or etc. to find an empty bucket. 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.