Author: Ricardo Gibert
Date: 07:06:28 01/18/05
Go up one level in this thread
On January 18, 2005 at 09:44:29, S J J wrote: > > I have a very novice program working without an alpha beta search. On the >surface, it looks like an alpha-beta search can miss a good sacrifice move. > > It does may sense that an alpha-beta search will help speed the evaluation >of a tree of, say, 6 ply. > > However, if there is a sacrifice on the sixth ply that does not gain >the material back until, for example, the 8th ply, won't the node be trimmed >when the sixth ply is evaluated and never have additional moves from that >node generated? With good move ordering alpha beta prunes only the redundant parts of the tree. It is theretically guaranteed to produce the same evaluation and the same best move 100% of the time as minmax does as proven by Knuth & Moore in Artificial Intelligence 6 (1975), 293-326. See the following for a nice explanation of alpha beta: http://www.brucemo.com/compchess/programming/alphabeta.htm
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.