Author: Tom Kerrigan
Date: 10:35:18 02/18/00
Go up one level in this thread
On February 18, 2000 at 12:09:35, Jeff Anderson wrote: >Hi, I am still trying to learn about the Alpha-Beta algorithm. I have one more >question. Thanks to all the people that helped me before: > >With the Alpha-Beta algorithm does the program generate the entire tree and then >score the remaining positions when there has been a cut-off, or when there is a >cut-off does it not generate unnecessary positions at all? > > >Thanks, >Jeff The alpha-beta algorithm is typically a recursive tree search. This means that the tree is being traversed, and not generated. Only one position is examined at a time. So if a cutoff occurs, it is pretty easy to "back up" and traverse the next part of the tree. -Tom
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.