Subj : Re: Implementing A* algorithm
To   : comp.programming
From : Arthur J. O'Dwyer
Date : Wed Jul 20 2005 05:24 pm


On Wed, 20 Jul 2005, CBFalconer wrote:
>
> "Arthur J. O'Dwyer" wrote:
>> Come on!  The OP wrote, and I quote: "I have a robot that has to
>> find the shortest route through a maze. Options for doing this are
>> either the A* or Dijkstra's algorithm."
>
> I had to leave an awful lot unsnipped to make this point.  What you
> just requoted was snipped when I read it.  The references did not
> exist.

   Not true; you replied to the original post itself to say "You have
excluded...," etc. All the context was there; you chose to ignore it.

> If I say "the counters are 2*421 encoded" does that immediately
> bring forth a specific implementation to you?

   Nope. Not even with a Google and Wikipedia search. I conclude that
"2*421 encoding" is either a company-specific buzzword, or else a
completely made-up term. (I could be wrong.) Certainly if someone
asks a question about something that can't be found online or in
standard references like TAOCP, they ought to provide more details.
That doesn't apply to the OP's question, of course.

-Arthur,
might help the OP more if he learned to attribute properly

.