Computer Chess Club Archives

Search

Messages

Subject: Re: Parallel search article RBF

Author: Gian-Carlo Pascutto

Date: 11:22:04 09/11/02

Go up one level in this thread

On September 11, 2002 at 13:36:35, Robert Hyatt wrote:

>I don't think what they did was _that_ bad.
>
>Best-first search is a known search algorithm, and it has a known
>weakness that they cover early on.  Their randomized approach is one
>way to attempt to minimize that weakness.

IMHO the approach is fundamentally flawed.

We use the search to cover what we cannot evaluate. The main goal
of the search is discover where the evaluation is not correct.

Their approach is contrary to this - therefore I suspect it
will never work well in actual games.

--
GCP

• Re: Parallel search article RBF Robert Hyatt 12:59:23 09/11/02
• Re: Parallel search article RBF Dann Corbit 11:58:29 09/11/02
  • Re: Parallel search article RBF Gian-Carlo Pascutto 12:10:49 09/11/02
    • Re: Parallel search article RBF Dann Corbit 12:27:32 09/11/02
      • Re: Parallel search article RBF Robert Hyatt 19:09:26 09/11/02
        • Re: Parallel search article RBF Vincent Diepeveen 05:30:36 09/13/02
          • Re: Parallel search article RBF Robert Hyatt 09:32:33 09/13/02
            • Re: Parallel search article RBF Vincent Diepeveen 13:19:28 09/13/02
        • Re: Parallel search article RBF Charles Roberson 19:27:22 09/11/02
          • Re: Parallel search article RBF Vincent Diepeveen 05:37:03 09/13/02
          • Re: Parallel search article RBF Robert Hyatt 06:33:01 09/12/02

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.