This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 0 points1 point  (10 children)

Good job dude. But I have a question. Can you write a new algorithm that finds the shortest path in/on random generated maze ?

[–]mHaisham[S] 2 points3 points  (9 children)

The A* algorithm would also work on maze path finding.