Author: David Hanley
Date: 09:15:05 10/28/02
Go up one level in this thread
Simple. A ply 'n' search might find only a so-so line that doesn't cuse as many cutoffs. The n+1 search could find a very good line that causes a lot of cutoffs later in the tree. dave
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.