An A* pathfinding project using Python.
It allows Manhattan distance, Diagnoal distance and usage of tie breakers (scaling and cross)
Based on the descriptions here: http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html#breaking-ties
Here is several screenshots from the resulting pathfinding runs:
NOTE: green is the node that was added to the path, red is visited neighbours, yellos is the path to the goal
