Author: Dieter Buerssner
Date: 07:42:02 08/09/01
Go up one level in this thread
You might want to have a look at Dennis Breuker's thesis: "Memory versus Search in Games". There is a chapter about graph-history-interaction, which discusses this problem. I don't have an URL handy, but it should be easy to find. The thesis is availble as a PS-file on the net. I agree with Bruce and Bob, that there is not much, you can do. One thing that helped in some positions was te following. When having a cutoff from the hash table, I check, if the hash move yields in a repetition of position. I will only allow the cutoff, when the stored score is a draw score then. But it will of course slow down the validation process of the hash move. Regards, Dieter
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.