# A* Pathfinding Animation

## Color Codes

- green: source
- maroon: target destination(s)
- black: obstacles
- orange: "open" squares
- red: "closed" squares
- yellow: squares on the shortest path

Note: Dijkstra's algorithm is a special case of A*

## References

A Formal Basis for the Heuristic Determination of Minimum Cost Paths - Hard, Nilsson, Raphael (IEEE Paper)

Written by Adrian Stoll on 20 Oct 2018