A* Algorithm

WIP article

Overview

The A* algorithm is a type of best-first search [citation needed] resembling the Dijkstra algorithm. The sole difference is its use of heuristics to prioritise the search paths to expand. In physical pathfinding, this heuristic will usually be the length of the path [citation needed], which is minimised.

Method

1. Open a node
2. For each open node, open the neighbouring nodes, noting the total distance and stuff, whilst closing the node behind
3. Remember the previous steps and stuff (I need to research this more it's been a long time)

C i t a t i o n n e e d e d

References

[1] A Formal Basis for the Heuristic Determination of Minimum Cost Paths