is the starting node
are obstacles nodes
is the ending node
is the best path
are evaluated nodes
are unevaluated nodes
Algorithms
Depth-First Search
Breadth-First Search
Dijkstra
*A
Start
Pathfinding
Generate
Maze
Diagonal movement