Computer Chess Club Archives




Subject: Negascout == PVS (with references)

Author: Dennis Breuker

Date: 05:20:00 07/28/04

Go up one level in this thread

On July 26, 2004 at 19:47:21, Peter Alloysius wrote:

>What's the different between negascout and PVS ? They look like the same
>algorithm to me.

They are identical, see note 15 on page 22 of my thesis
(freely downloadable from

<begin quote>
We note that the version of principal-variation search as mentioned
by Marsland (1986) is identical to the version of negascout as mentioned
by Reinefeld (1989). We use the 1989 reference instead of 1983, which was
the first source of this algorithm, since the algorithm described in
Reinefeld (1983) contains minor errors.
<end quote>

- Reinefeld, A. (1983) An Improvement to the Scout Tree Search Algorithm.
  ICCA Journal, Vol. 6, No. 4, pp. 4-14.

- Marsland T.A. (1986). A Review of Game-Tree Pruning.
  ICCA Journal, Vol. 9, No. 1, pp. 3-19.

- Reinefeld A. (1989). Spielbaum-Suchverfahren.
  Springer-Verlag, Berlin, Germany. In German.


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.