Pathfinding optimization

In the A* implementation, the heap comparator function should choose the node with the greater g-value if the f-values for both nodes are equal. This results in a potentially massive performance improvement, I think especially on maps with large open areas.