
In my searching to find and understand the A* algorithm, I've found a couple of useful sites. First the obligatory link to the
wikipedia article. Next a
beginner's tutorial to the A* algorithm by Patrick Lester.
This algorithm looks fairly straightforward. The most difficult part would be the implementation of the
h(x) function, the heuristics function. Both the wikipedia article and Lester's article mention that Dijkstra can be implemented using A* by setting
h(x) = 0 for all x.
Any other links or thoughts on implementing this algorithm? I think that we should examine implementing A* such that it can be used independently of the library if possible.

