Author: Reinhard Scharnagl
Date: 07:30:26 01/12/04
Go up one level in this thread
You has been talking on *quiescence search*. May be, we discussed that theme already somehow at a german language forum. Possible targests on search algorithms to reach in a combinatoric way will be charcterized by the end leafs of the search tree. The quiescence search is mostly materialistic, therefore reaching goals, which have also positional quality is only done by pure good luck. Because of that I would prefer a *deescalation search* which also will follow positional combinations, ending in leafs with a more stable positional fine evaluation. Those leafes should be the real targets of a combinatorical search. Regards, Reinhard.
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.