Author: martin fierz
Date: 07:18:55 03/29/04
Go up one level in this thread
On March 29, 2004 at 10:17:18, martin fierz wrote: >everybody knows that with plain alpha-beta, a fixed number of moves N per node, >and perfect move ordering a search to depth D needs > >nodes(depth) = sqrt(N)^(D/2) nodes. [snip] sorry, typo, that should of course read either: nodes(depth) = sqrt(N)^D or nodes(depth) = N^D/2) but not both... :-) cheers martin
This page took 0.01 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.