Author: Steve Maughan
Date: 11:11:21 03/29/04
Go up one level in this thread
Martin, Point taken. Here's my second attempt - not sure it's any better than yours: Nodes = N ^ (D / 2) x N ^ (D / 2) / (N ^ (F x D / 2)) This simplifies to: Nodes = (N ^ D) / (N ^ ( F x D / 2)) When F = 0 (i.e. worse than random) Node = N ^ D and when F = 1 (perfect) Node = N ^ (D /2). This formula shows massive changes in nodes whith different move ordering. Interesting topic! Steve
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.