Author: Bruce Moreland
Date: 15:09:14 08/01/99
Go up one level in this thread
On August 01, 1999 at 17:28:12, Torstein Hall wrote: >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 ;-} > >I'm no expert at this, but I will try to explain it anyway! >If you search a position and find that the oponent has a very good reply, its no >point continuing down that branch in the tree! > >Torstein Yes, if you know that you have a strategy that is fine for you, and you discover a second strategy that you can prove is worse than this first strategy, don't spend a lot of time trying to figure out exactly how bad this second strategy is. Once you know that it is as least as bad as the first strategy, discard it. 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.