Author: Tony Werten
Date: 23:57:25 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? Most likely, yes. But also will minimax or MTD. When you start programming, first accept that when you search 6 ply, you see nothing from ply 7. When you're more experienced: try to solve that problem. Tony
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.