]]>

Here you should test the node that has the lowest "distance from src + heuristic", so probably one of the node adjacent to the violets.

]]>The issue here, is that the violet squares should be on the "open set", so should not have been tested by the algorithm.

]]>The cyan squares represents the current shortest path, the violet squares represent paths the algorithm has tested, and the dark gray squares are walls. So currently, the algorithm has backed the "best path" into a corner. What would the A* algorithm do here?

]]>