Author: Gian-Carlo Pascutto
Date: 02:05:28 06/25/02
Go up one level in this thread
On June 24, 2002 at 19:05:22, Steve Coladonato wrote: >In that case, then would not the use of a selective search be considered an >inferior algorithm to use. No, unless you are comparing at the same ply depth. But the selective searcher will get deeper faster. >I don't know how each program evaluates its score >for a given position and I do know that the evaluation can be tweaked via >configuration files. So if the configuration files were ruled out such that >each program scored the position the same, Probably impossible. For many programs, there is a direct link between search and evaluation, meaning that if you'd alter the evaluation, different tradeoffs may need to be taken in the search. >would not the faster (to a given ply >depth) program win? No, if it prunes too much it may make mistakes. -- 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.