Author: Don Dailey
Date: 11:47:43 05/05/98
Go up one level in this thread
On May 04, 1998 at 16:38:43, Roberto Waldteufel wrote: >I have read about the singular move extension heuristic as used by >Deeper Blue, and indeed about extension heuristics in general. I have >also experimented with some variable depth schemes in my search trees. >One quite promising idea is to set the depth to some arbitrary value at >the start of each iteration (this value being increased a little prior >to each successive iteration), and then decrease the depth at each odd >level by an amount proportional to the logarithm of the number of legal >moves for the opponent at that level, and calling a quiescence search >when this depth drops below zero. The depth remains unchanged at even >levels. This has the effect of pusuing forcing lines for the machine >much deeper, even if some quiet moves are interspersed between the >checks. It works very well for some tactical positions where the machine >can mate or win material through a long sequence of moves, most, but not >all of which are checks. > >I understand that in the singular move extension scheme, the node is >extended if its evaluation is significantly higher than that of its >next-best sibling, but I do not understand exactly how this condition >can be tested when a beta-cutoff occurs, since the evaluation scores for >some of the sibling nodes is then not known to the algorithm. Can >anybody enlighten me? > >Robeto Waldteufel Robeto, I don't understand. Is part of this algorithm never to stop on an even ply number? - 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.