A helpful visual tool for learning various graph theory search algorithms.
Build mazes and see how each search algorithm finds its way from start to finish.
Easily customize your grid size, search order, distance calculation method (Euclidean or Manhattan), etc.
Algorithms included: depth-first search, breadth-first search, best-first search, and A* search.