Re:Solving mazes using Python: Simple recursivity and A* search
by endtime on Friday March 11, 2011 @05:35PM
(#2315194)
A correct implementation of A* might look simple, and indeed it's not the most complicated algorithm out there, but I wouldn't dismiss it until you've read and understand the proof of its optimality.
Re:Solving mazes using Python: Simple recursivity and A* search
by orijing on Friday March 11, 2011 @11:42PM
(#2316026)
Of course, I've dealt with many search problems using A* (in particular, in the context of machine translation). I understand the algorithm and the proof of optimality. And I agree, the algorithm is very simple (not much different than uniform-cost search)--the complex part (in more general applications) is the heuristic function.
Seems like an instance of a common metaphor:
I don't see where I dismissed A*.
>Seems like an instance of a common metaphor
That gave me the impression that A) it was new to you (due to the "seems to be") and that B) you weren't impressed ("common").