Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search algorithms

Author: Robert Hyatt

Date: 06:47:32 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.
>
>--
>GCP


Eh?  The distinction is _huge_.

One searches the tree in one direction and requires very little memory.  The
other searches the tree in another direction and requires huge memory.

I'm not sure how you could say that the distinction is very hazy.  They
are as different as night and day...




This page took 0.01 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.