Author: Bruce Moreland
Date: 15:05:11 08/01/99
Go up one level in this thread
On August 01, 1999 at 17:21:17, Jeroen van Dorp wrote: >In principle an alpha beta searcher keeps the trees are kept as narrow as >possible? >Is there a connection with selective search? Or is selective search alpha beta >search? > >Jeroen ;-} Alpha beta search is just a way of cutting out some work. It is not selective. When I said it was "safe", I meant provably safe, as in put the math guys to work on it for a while and they'll make a proof. If you have a min-max search that looks at every move to depth D, it will produce a move with the same score as an alpha-beta search to depth D, but the alpha beta search will search the same amount of nodes in the absolutely pathological worse case, and a heck of a lot fewer in the practical case. bruce
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.