Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Can someone explain (simply) how to detect singularity?

Author: Steve Maughan

Date: 01:10:02 09/02/01

Go up one level in this thread


Bob,

Thanks for the reply!

>On a PV move, you search the first move and get the score.  You search the
>remainder of the moves with the window alpha-N, beta-N, where N is somewhere
>around 1/2 a pawn or whatever singular margin you want to use.  If all the
>movesfail low, then you know the first move is at least 1/2 pawn better than
>all the rest, which means it is singular.  Of course, if one of the other (not
>the first move) fails high, you have some work to do to determine if it is
>singularly better than all the rest, including the first one.

Hmmm, that seems like quite a bit of overhead.

>It is complex and it takes some search overhead. There is another way that is
>cheaper but significantly less accurate...

Now you're got me thinking - what's the cheaper way? Any hints?

Thanks anyway,

Steve



This page took 0.03 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.