Author: KarinsDad
Date: 11:03:21 04/12/00
Go up one level in this thread
On April 12, 2000 at 12:08:37, Tom Kerrigan wrote: [snip] > >I don't care for this method because you have to go through your entire hash >table and set these bits. That takes about as long as clearing the hash table, >which makes it unreasonable to have large hash tables for fast games. > >What you can do is take any leftover bits in your hash entries and use them for >a counter. Every time you start a new search, you increment the counter. If you >find an entry with an old counter value, you can toss it. > >-Tom I like it. What size counter do you use? 2 bytes? 4 bytes? How large does your hash table get? KarinsDad :)
This page took 0.01 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.