Author: Ren Wu
Date: 18:08:04 03/03/98
Go up one level in this thread
I am wondering this too. There are a few ways doing this 1. clear hashtable after every move 2. clear hashtable after evary game 3. mark each entry as 'old' every time start a new search 4. never, but when program restart, it start from a new hash table 5. never, even reload it back when resrart. 6. etc, etc I use 3 from day one, until one day i forgot to put the code which mark entry 'old' back, which in turn make my program use 4 above. surprisely, it seems no noticed effect. or maybe even better. So i am puzzled. My program relayed on root analysis, and will adjust quite a lot of paremeters before the search. so not clear the hashtable, as well as mark it 'old' have potential problem, but I am not sure which is the best way to handle this? Any commends? Ren. btw, my email address is now renw@iname.com, but i don't know how to change it here.
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.