Computer Chess Club Archives




Subject: PVS and NegaScout

Author: Gian-Carlo Pascutto

Date: 11:35:18 01/05/00

Hi all,

what is the difference between a Principal Variation Search
and the NegaScout algorithm ?

Everytime I look at them, they seem to do exactly the same
thing, except that NegaScout has a special case if depth > 2,
but because of extensions, you can't use that in a chess program.

So, what *is* the difference ?


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.