Subj : Re: Implementing A* algorithm
To   : comp.programming
From : CBFalconer
Date : Mon Jul 18 2005 10:21 pm

Christer Ericson wrote:
> cbfalconer@yahoo.com says...
> 
>> You have automatically excluded all replies from those not familiar
>> with A* (whatever that may be) and/or Dijkstra's (who was a
>> remarkably able programmer and probably published thousands of
>> algorithms during his lifetime).
> 
> There's nothing wrong with the OP's question.  There is only
> one algorithm of Dijkstra's known as "Dijkstra's algorithm"
> and it is taught in many computer science programs. See:
> 
> http://en.wikipedia.org/wiki/Dijkstra's_algorithm

Well, on casual examination of my books here, I immediately find
Dijkstras algorithm as an extension to N processes of Dekkers
algorithm for mutual exclusion.  I can also find his solution to
the Dining Philosophers problem.

> 
> The A* algorithm is taught in just about every introductory
> AI class in the world:
> 
> http://en.wikipedia.org/wiki/A-star_algorithm
> 
> I don't see how you think that anyone unfamiliar with either
> or both algorithms would be able to meaningfully comment on the
> merits of the one algorithm over the other.

I never took an introductory AI class, and I gravely doubt that I
ever will.  Since the original problem (IIRC, you snipped any
evidence of it) showed similarities to traveling salesmen, I
suspect it requires some sort of exhaustive search.  I have never
been noted for inability to comment, however I must leave the
'meaningful' adjective for others to apply.

-- 
"If you want to post a followup via groups.google.com, don't use
 the broken "Reply" link at the bottom of the article.  Click on 
 "show options" at the top of the article, then click on the 
 "Reply" at the bottom of the article headers." - Keith Thompson

.