Author: Dann Corbit
Date: 12:29:12 12/13/01
Go up one level in this thread
On December 13, 2001 at 06:07:37, Wylie Garvin wrote: >Hello, > > Does anyone know what the best-performing rehashing scheme is? I read >somewhere (Heinz) that multiple probes in one table perform better than separate >tables. I've also heard that subtree size is best for choosing a node to >overwrite. What does the board think? > I have an idea which I have never tried, but it seems it might have merit. For chaining, use a list of hash tables, which decrease in size exponentially. So, if the first is 64 megs, then the next might be 130K, and a 3rd of only 512 bytes. Or something like that.
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.