Author: Ernst A. Heinz
Date: 15:10:12 01/15/98
Go up one level in this thread
On January 15, 1998 at 17:29:22, Amir Ban wrote: >On January 15, 1998 at 07:24:55, Ernst A. Heinz wrote: >>Proven standard is depth having higher priority than bound type. >>Many experiments of different researchers agree on this. >> >>It also holds for "DarkThought". >> >>=Ernst= > >I know this is the standard, and I have been doing it myself. Lately I >deviated from this and I am pleased with the results so far. I was certain that you knew this -- just mentioned it for other, probably uninformed observers ... >Here's a scenario that may show why depth-priority might do more harm >than good: Suppose you do a windowed search, and it fails high. Many of >the nodes in the subtree now have a hash entry which says GE beta. You >are now going to open the window and redo the search, probably visiting >all these nodes again at the same depth, but with a different alpha-beta >window. If you think about it, all your hash info is useless because >your new alpha-beta window already says it. Now, you could be gathering >new and useful hash info at lower depths, but you are not recording >because of your depth-priority, so you are stuck with the useless data. Well, I would not call the data useless -- it still gives you a quite accurate best move which the shallower entries with better bounds might not ... =Ernst= many direct cutoffs as it
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.