Author: Robert Hyatt
Date: 08:48:40 06/26/00
Go up one level in this thread
On June 26, 2000 at 10:18:39, blass uri wrote: >On June 26, 2000 at 09:23:12, Robert Hyatt wrote: > ><snipped> >>(2) there is only _one_ entry in the table at the index "N", where >> >>N=hash_signature & log2(hash_table_size); > >Do you mean that if there are 2 positions with the same last N bits signature >you save only one of them in the hash tables even if your hash tables are not >full? > >Uri Correct... although I actualy use two hash tables. In the first, I make a careful decision on whether to replace the old entry with the new one, based on how useful the old entry appears to be. In the second table I do the following: If I replaced an entry in the first table, the entry from the first table is moved to the second table. If I didn't replace anything from the first table, I simply replace whatever is in the second table without a second thought.
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.