Author: Ernst A. Heinz
Date: 07:59:13 11/24/98
Go up one level in this thread
On November 24, 1998 at 09:59:02, Amir Ban wrote: > > [...] > > Junior is more aggressively extended than most PC programs, and therefore > more than DB. Amir, I do not think that your above chain of reasoning is valid because we really do not know how much "DB" extends. I am convinced that "DB" extends far more than most PC programs as well. Whether "Junior" exceeds "DB" in this respect is open to speculation but not to conclusive argument. BTW, I happen to remember a post on RGCC shortly before the Kasparov rematch. The poster had apparently talked to Murray Campbell during a conference and reported that Murray said something about the search trees of "DB" being very broad at the top, then stringy because heavily extended in the middle, and quite bushy again at the bottom where the special-purpose chess processors resorted to 4 plies or 5 plies of non-selective (i.e. also non-extended?) full-width search again. Especially the final full-width part of the chess processors would result in a completely different tree-structure than those of all others if my memory serves me right and the original report was true. =Ernst=
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.