Computer Chess Club Archives

Search

Messages

Subject: Re: Search algorithms

Author: Renze Steenhuisen

Date: 06:33:28 11/06/03

Go up one level in this thread

On November 06, 2003 at 08:33:49, Gian-Carlo Pascutto wrote:

>On November 06, 2003 at 05:45:53, Renze Steenhuisen wrote:
>
>>Depth-First Algorithms:
>>  AlphaBeta (Fail-hard, Fail-Soft)
>>  MTD(f)
>>
>>Best-First Algorithms:
>>  SSS*
>
>The distinction between the three (and best-first and depth-first)
>is very hazy, read "Research re: search and research" by Aske Plaat.

Done that already, but as Aske stated: they search the same nodes, but in a
different order.

MTD(f) and the others are still DF algorithms, the second list works differently
(i.e., the order in which the nodes are expanded is different).

Or am I talking rubish?

Renze

PS:  Am I missing algorithms (either important or not)?
PS2: Are Scout and NegaScout equal?

• Re: Search algorithms Robert Hyatt 06:49:33 11/06/03
  • Re: Search algorithms Dave Gomboc 08:23:36 11/06/03
    • Re: Search algorithms Robert Hyatt 16:50:09 11/06/03
      • Re: Search algorithms Dave Gomboc 17:45:57 11/06/03
        • Re: Search algorithms Robert Hyatt 19:33:04 11/06/03
          • Re: Search algorithms Robert Hyatt 19:42:14 11/06/03
            • Re: Search algorithms Dave Gomboc 11:16:16 11/07/03
              • Re: Search algorithms Robert Hyatt 09:43:29 11/08/03
                • Re: Search algorithms Dave Gomboc 09:01:59 11/09/03
                  • Re: Search algorithms Robert Hyatt 17:38:25 11/09/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.