Computer Chess Club Archives

Search

Messages

Subject: Re: Programmers: beginner tree search questions

Author: Gian-Carlo Pascutto

Date: 15:02:45 09/30/03

Go up one level in this thread

On September 30, 2003 at 17:37:27, Dieter Buerssner wrote:

>On September 30, 2003 at 16:49:41, Gian-Carlo Pascutto wrote:
>
>>PVS = Negascout
>
>I don't think so. See http://www.zib.de/reinefeld/bib/83icca.pdf
>To me the unique thing about Negascout is to avoid those reasearches that
>initially returned scores out of bounds close to the leaf. Of course, I think
>that Negascout will not work in most chess engines (which use pruning,
>extensions, qsearch, etc.) but only in a fixed depth environment.

For any practical implementation you have to drop the optimization
and they become identical.

--
GCP

• Re: Programmers: beginner tree search questions Dieter Buerssner 15:17:33 09/30/03
  • Re: Programmers: beginner tree search questions Dave Gomboc 14:43:11 10/01/03

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.