| A | B | C | D | E | |
|---|---|---|---|---|---|
1 | |||||
2 | Pathfinding | ||||
3 |  | By Astral | Version 1.0 | ||
4 | This sheet is a collection of all the pathfinding | ||||
5 | formulae I have developed thus far. | ||||
6 | The map is generated using Randomized Prim's, and | ||||
7 | there are implementations of Breadth-First Search, | ||||
8 | Dijkstra's Algorithm, and the A* Algorithm. | ||||
9 | Note that BFS and Dijkstra's are effectively the | ||||
10 | same. This is because this map is unweighted and | ||||
11 | undirected. | ||||
12 | Shoutout to Rowan Sharman for his iterative | ||||
13 | calculation based method. You can find his blog | ||||
14 | here. | ||||
15 | |||||