This website visualizes pathfinding algorithms.
Currently, available algorithms are Dijkstra, A* with several
different heuristics, depth-first and greedy best-first.
A* is an extension of Dijkstra's algorithm and uses heuristics
to determine which nodes should be visited next.
A* selects the path that minimizes f(n) = g(n) + h(n),
where n is the last node on the path, g(n)
is the cost of the path from the start node to n, and h(n) is a heuristic that
estimates the cost of the cheapest path from n to the goal.