Author: Don Dailey
Date: 13:03:55 09/17/98
Go up one level in this thread
On September 16, 1998 at 12:09:31, blass uri wrote: >I believe a slow searcher can be better because you must have a slow searcher to >evaluate which lines are more important to analyze. > >I think that a slow searcher can be better also in test positions than fast >searcher because of this reason. > >What do you think about it? It depends on which program plays the better moves. You can always play better chess with a deeper search, and you can also always play better chess with more evaluation. If you have a program that is extremely slow it had better have superb evaluation. If it is extremely simple in the static evaluation function, it had better be awful fast. The trick is to go for both, as much knowledge as possible, as fast as possible. There is no meaningful answer to your question except to say that the program that makes the best tradeoff between search speed and these other factors will be the strongest program. - Don
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.