Author: Robert Hyatt
Date: 10:13:22 10/28/02
Go up one level in this thread
On October 28, 2002 at 01:17:41, Nagendra Singh Tomar wrote: >What all reasons can you think of for a ply 'n+1' searching lesser nodes than >ply 'n' search. > >regds >tomar It should be very rare. But I see no reason why it can't. One example... at ply=n, the first move has a score of +1.0 and the other moves are all very complicated and lead to scores just under +1.0. At ply=n+1, the first move has a score of mate-in-10, which will cause the other moves to be searched very quickly since they will all be way under the alpha value. But again, this should not happen often. If it happens too frequently, it suggests that something bad is going wrong with move ordering.
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.