Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What is Negascout and why is MWS PVS?

Author: Severi Salminen

Date: 05:10:42 11/25/00

Go up one level in this thread


>Ahem...NegaScout and PVS are the same algorithm, but implemented
>differently. PVS treats the first move specially, as an exception
>case, whereas it is blended in in the NegaScout algorithm.
>NegaScout does search the best move from the previous search first,
>so it isn't an improvement over PVS. They're equivalent.

How can this blending be done?

>>This has been taken to the extreme in the MTD(f) search, where even the first
>>move is searched with a minimal window. You can read about that and also find
>>some interesting links on Aske Plaat's (old) page
>
>This is a tricky simplification. There a many possibilities to do a zero-
>window search on the first move that aren't MTD(n,f).

So what _is_ the difference between NegaScout and MTD(f)?

And thanks for these explanations!

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.