Author: Gian-Carlo Pascutto
Date: 04:58:06 09/11/01
Go up one level in this thread
On September 11, 2001 at 02:26:58, Uri Blass wrote: >On September 10, 2001 at 21:15:38, Dave Gomboc wrote: > >>On September 10, 2001 at 05:31:18, Uri Blass wrote: >> >>>No >>>If you extend a full ply for every singular move by 0.25 pawn you will never >>>finish your search. >> >>Sorry, Uri, but that's simply not the case. > >Deep thought needs to refute more than one line in order to get a score of +2 >and if the singularity in most of the nodes is only singularity of 0.25 there is >no singularity in order to prove the +2 score. As I have stated before, once the singular move drops in score, for example to -2, then the others are reevaluated for singularity. Because of this and the hashing, there can be multiple singular moves at a node, and there can already be known singular moves at nodes that haven't actually been searched yet. -- GCP
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.