Computer Chess Club Archives

Search

Messages

Subject: Re: Negascout == PVS (with references)

Author: Fabien Letouzey

Date: 05:47:01 07/28/04

Go up one level in this thread

On July 28, 2004 at 08:20:00, Dennis Breuker wrote:

>They are identical, see note 15 on page 22 of my thesis
>(freely downloadable from http://www.xs4all.nl/~breukerd/thesis/):

><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>

Can you confirm that PVS re-searches with window (value,beta), and not
(alpha,beta) as I claim, in Marsland's article?

Thanks,

Fabien.

• Re: Negascout == PVS (with references) Fabien Letouzey 05:50:15 07/28/04
  • Re: Negascout == PVS (with references) Dennis Breuker 00:33:55 08/02/04
    • Re: Negascout == PVS (with references) Stuart Cracraft 07:05:48 08/03/04
    • Re: Negascout == PVS (with references) Tony Werten 01:00:19 08/03/04

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.