Author: Gian-Carlo Pascutto
Date: 01:30:06 09/10/01
Go up one level in this thread
On September 09, 2001 at 20:28:07, Uri Blass wrote: >My point is that the program find that move A is clearly better than the rest >Move A has score of 0.2 for black before the decision to do singular extensions >when move B has score of 0.5. > >Move A has score of 2 for black after doing the singular extension and the >program choose move B that does not get extended so the program gets 0.5 Why wouldn't B get extended? After a move has been singularly extended and changes score the singularity status of _all_ moves on that node are reevaluated. In your example, the computer would extend A, find that it's bad, get B as a new singular move, and extend again. -- 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.