Author: Tord Romstad
Date: 14:55:10 12/26/03
Go up one level in this thread
On December 23, 2003 at 18:25:26, Christophe Theron wrote: >Another idea is to have an engine that performs two searches at the same time: a >very deep, full speed tactical search, and a less deep, very slow positional >search. The problem is what to do with the two results when they differ... :) I almost missed this very interesting discussion. What you describe above sounds slightly similar to an idea I have been playing with lately. Since a long time, I have been using reduced-depth interior searches to improve the accuracy of pruning decisions. I assume that most chess programmers use similar techniques (the most well-known examples are normal recursive null-move pruning and ProbCut). The last couple of weeks, I have been experimenting with replacing the reduced-depth searches with reduced-evaluation searches at nodes where the tactical accuracy of the pruning decisions is likely to be more important than the positional accuracy. Tord
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.