Author: Ernst A. Heinz
Date: 11:10:12 01/26/00
Go up one level in this thread
On January 26, 2000 at 00:33:32, Robert Hyatt wrote: > > [...] > >6. They _might_ just be very good tree search theoreticians. I personally >believe that Hsu and Campbell know as much about alpha/beta searching as any >of us, and just possibly more... Oh, I never doubted that and totally agree with you on this point. But I neither doubt the square-root complexity of the critical alpha-beta tree. I know that this is O-calculus complexity and that the critical tree need not necessarily represent the smallest possible alpha-beta tree yielding the same root result. That is why I speculated about ETC. Yet still, the effective branching factors of 3-4 following from the times cited by you are mysterious ... =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.