Author: David Hanley
Date: 11:32:11 01/09/02
Go up one level in this thread
On January 09, 2002 at 13:55:45, Gian-Carlo Pascutto wrote: >no hashing or pruning with perfect ordering can be described by > >bf = branching factor = 38 > >nodes = (bf)^ceil(depth/2) + (bf)^floor(depth/2) - 1 > >for an 8 ply search, that is 4 170 271 nodes I think that's it. I just wrote a little alphabeta that plays a game for which i can always generate a perfectly ordered move list, and here was my result: "A search of depth 8 took 2310547 nodes and 4170271 evals" Hmmm.. This kind of screws up a clever algorithmic idea i had. On the other hand, with no alphabeta, it searches 4,347,792,138,496 nodes. dave
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.