Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Please explain the difference between PVS and NegaScout

Author: Severi Salminen

Date: 01:35:25 03/03/01

Go up one level in this thread


>Pseudocode
>PVS:
>if x>=beta cutoff_right_now;
>if x>v     x = re-search (-beta, -alpha);

According to Heinz one should use _your NegaScout_ method in PVS (this is what I
use):

if(x>alpha&&x<beta)
   x=re-search(-beta,-val+1)

>NegaScout:
>if x>=beta cutoff_right_now;
>if x>v  {  x = re-search (-beta, -v);   /* narrower window than PVS! */

I think -v is really not right. As it will most likely cause cutoffs even though
it might be the real value! That's why it should be -v+1

>           if alpha < x && x < v {
>                                   /* it did not work, so do it like PVS */
>                                   re-search (-beta, -alpha);
>                                 }
>
>
>        }

I use the PVS I described and actually have never done any research after
research. I don't think it is necessary if you have the +1 addition. I'll have
to test this one.

The interesting thing is that I read somewhere that the difference between PVS
and NS is that in NS you allways assume that you get the true score if you are
at D==1 or D==2. This info is from the SSS thesis. I'll have to try to find it
and check it out.

>I hope I explained this right. I did it from memory, there is a website
>that there is code for it. I think that there is a link in the site
>where MDF is explained...
>If you don't find it I will try to find it for you, let me know.

Yes, I have the link, thanks.

Severi



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.