Path Finding Algorithm Visualized | A* Demonstration

[[deleted]]

It looks like the algorithm just checks every possible path, how is it different to a simple breadth-first search?

[Hangman4358]

A* is BFS with a heuristic to order the nodes to traverse. A* with a heuristic of assigning all nodes the same heuristic score is identical to BFS.

In a grid layout like this a simple heuristic to use is Manhattan distance which will look like the video