Author: Dan Andersson
Date: 14:50:46 01/10/02
Go up one level in this thread
One reason that search is discussed so much is, IMO. That the static scores of evaluators are 'always' wrong. It means that an efficient and intelligent search (including extensions) will trumph a less efficient search allmost all the time. Due to the fact that the search essentially 'mines' the search space for a more accurate evaluation. A much better approach is to tailor your evaluator to your search. Granted that a good evaluator is preferable to a bad one. But making it behave consistently inside your search framework is the number one priority. But discussions of evaluation factors are always good. As for good/bad bishops a dynamically computed piece square table is an option. And not all that expensive if you hash it, or make an 'el cheapo' function. The bishop might not be bad if it occupies an active square. Or it might be very bad in an open position if it is acting as a blockading piece for a pawn. MvH Dan Andersson
This page took 0.01 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.