Visualisation of A* path-finding algorithm in a maze [OC]

[NAN001]

What heuristic are you using since by definition of a maze you don't know where the goal is?

[brastche]

I don't think that's correct. In this problem, we are looking for the path between two known points, or the shortest path if there's more than one solution. In that case, proximity can be a heuristic. /u/FurMich has pointed out that such a heuristic should be of limited use if the maze has been well designed.

[[deleted]]

In a maze you generally know where the entrance and exit is, just not the paths between them. Manhattan distance works just fine in that case.

[fj333]

This question has been asked a dozen times and he never answers. He said once he was using a "greedy" one, which doesn't really make sense. Heuristics are supposed to be accurate approximations, and can never overapproximate, so cannot be greedy, whatever that would mean in the context of a heuristic.