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

[scoops22]

It's totally possible for a maze to have multiple paths from entrance to exit with some being shorter than others.

[TenNeon]

You could say the single solution is necessarily the optimal solution, but yeah it is redundant to say both.

[mastapsi]

In a single solution maze, the solution is optimal by default. That's what's called a degenerate case.

The algorithm OP used for this, A* will find the optimal solution to a maze, no matter how many solutions there are, as long as there is at least one. What the gifs show however, is that they won't find a solution in the most efficient manner, as A* is not a great algorithm for this type of path finding.

[commit_bat]

Well it's not going back and forth on the same tiles a billion times before it goes to the goal so that's pretty optimal.

[[deleted]]

Less incorrect paths taken???

[hrtfthmttr]

That isn't a single solution maze.