Author: Zach Wegner
Date: 07:48:11 01/06/04
Go up one level in this thread
On January 05, 2004 at 08:48:23, José Carlos wrote: > Hi, I'd like to try singular extensions in my program. I've been trying to >think about it and all my tries so far result in worse performance. After some >web search I haven't been able to find anything but the general idea described. > Is there any good description somewhere? Some pseudo-code? I guess there must >be something interesting in the archives but I can't download all of them. > Thanks in advance, > > José C. The way Hsu described it was along the PV, you search all moves like normal, and you have two values containing the best and second best scores, and after all moves are searched, if the best score is more than the second by a certain margin, then research the best move with a deeper depth. Regards, Zach
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.