Other well-known path finding algorythms are Hill Climbing and Best First (a Google search should give you more info about them). The thing about A* is that it is guaranteed to give the shortest path in the most efficient way (as long as the heuristic value is computed correctly and you give reasonable values to node depths). If you don't care about getting the best path, another search method may do the work, if you want the best path, then A* is the way to go.
A* alternatives?
BlitzMax Forums/BlitzMax Programming/A* alternatives?The forum is locked. These are the original blitzbasic.com forums, kept so they can still be read. No new topics, replies or edits can be made here. To join in, head over to the Blitz3D+ forums.