Computer Chess Club Archives


Search

Terms

Messages

Subject: How fast should a search tree expand?

Author: John Coffey

Date: 11:27:37 09/20/98


Let us say we are in a normal middle game position with about 30 leagal moves
per side.   Years ago I heard that an alpha algorithm would expand the tree
about 30^N where N is the number of ply deep.  I also heard that an alpha-beta
algorithm would expand the tree about 30*6^(n-1).  More recently I have heard
that some algorithms improve upon this quite a bit.

One program claimed to be  getting 2 to 3 raised to the N depth, but this I find
hard to believe.

John Coffey



This page took 0.02 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.