In computer science, A* (pronounced “A star”) is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes. Noted for its performance and accuracy, it enjoys widespread use. [Wikipedia]
My implementation uses a tie-breaker based on the cross product of the vectors from the start to the target and the evaluated node and the target.
The A Star App was coded in java. If your browser doesn’t run java you can download the A Star Jnlp file and run it from your desktop.