News for hackers. Stuff that matters.
Re:Solving mazes using Python: Simple recursivity and A* search by orijing on Friday March 11, 2011 @04:26PM (#2314983)
Not to be pedantic, but where's the recursion?

Seems like an instance of a common metaphor:

    while queue.hasElements():
      element = queue.pop()
      explore element if we haven't already
      put element's successors into queue using some priority
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.

I don't see where I dismissed A*.

Re:Solving mazes using Python: Simple recursivity and A* search by endtime on Saturday March 12, 2011 @03:01AM (#2316334)
Maybe I misunderstood this:

>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").

Re:Solving mazes using Python: Simple recursivity and A* search by dminor on Friday March 11, 2011 @04:56PM (#2315082)
There are two separate algorithms - the first one is recursive.
Re:Solving mazes using Python: Simple recursivity and A* search by Kafka on Friday March 11, 2011 @06:46PM (#2315403)
I wonder how the algorithm would be affected by weave mazes. http://weblog.jamisbuck.org/2011/3/4/maze-generation-weave-m...
Re:Solving mazes using Python: Simple recursivity and A* search by mukyu on Saturday March 12, 2011 @12:16AM (#2316080)
Neither is.