Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search algorithms

Author: Robert Hyatt

Date: 16:48:33 11/06/03

Go up one level in this thread


On November 06, 2003 at 10:18:37, Gian-Carlo Pascutto wrote:

>On November 06, 2003 at 09:47:32, Robert Hyatt wrote:
>
>>I'm not sure how you could say that the distinction is very hazy.  They
>>are as different as night and day...
>
>Read the thesis, you will understand.
>
>--
>GCP

This is one of those cases where I don't have to "read the thesis to
understand".  There's a _ton_ of books that discuss the differences
between breadth-first and depth-first search strategies.  They are
_never_ mentioned in the same paragraph as having similar properties.
Because they don't.  The actual tree space searched has nothing to do
with the search strategy used to search it.  It is _how_ the tree
is searched, not the tree itself, that defines the approach.




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.