I have a square-based map. Only horizontal and vertical movement is allowed (no diagonals). Movement cost is always 1.
I'm implementing an A* algorithm on that map, using the Manhattan distance as a distance heuristic. Is this heuristic consistent? Can I can avoid checking
g(node) against nodes that are in the CLOSED set?
Edit: By consistent I mean monotonic.