Author: Gian-Carlo Pascutto
Date: 08:30:38 11/08/01
Go up one level in this thread
On November 08, 2001 at 08:28:07, Torstein Hall wrote: >Can a program with more knowledge search faster then "expected" because it can >stop many bad lines earlier? I would think so, yes. If you have a good eval you can rely on smaller searches to give an accuarete assesement. I think this is the reason why Vincent can use R=3 nullmove quite safely, while the rest of use usually notice tactical weakening of our engine. -- GCP
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.