Author: Daniel Clausen
Date: 06:29:10 11/08/02
Go up one level in this thread
On November 08, 2002 at 07:26:59, Uri Blass wrote: [snip] >choose n=2 and you have that 2^n-1=3 and it is a prime number. >The same for n=3 and n=5. > >For some reason I do not think that 3,7 or 31 entries is the best >so I do not understand what you are talking about. > >Uri I'm talking about the fact, that for many multi-probing algorithms it's very helpful that the #slots is prime, because that ensures that _all_ slots are eventually probed. As I said in my other reply, that's probably not a big issue in CC, since we don't typically probe more than 4 or 8 times to find an empty slot. Sargon
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.