Author: Dann Corbit
Date: 14:12:05 02/19/02
Go up one level in this thread
I think the optimal is probably somewhere in the middle. A completely stupid search (material only) with R=3 null move can search to terrific depths. But a smart searcher will kill it. A super-expensive search (CS-Tal) is probably not going to see deep enough sometimes. So the deep searchers can bludgeon them (I remember a post where Bruce Moreland was talking about how a recent Ferret was getting outsearched since he had added so much knowledge). A relatively deep but also knowledgeable search seems (logically to me) the most sensible. The hard part is finding the balancing point.
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.