A* (A-Star) Search
A* Search is a pathfinding algorithm that uses a heuristic to determine the next node to visit. In this examaple, the heuristic is calculated using the Manhattan Distance equation. This algorithm is guaranteed to find the shortest path between the start and end nodes.
Instructions:
1) Select a search algorithm from the dropdown menu above.
2) Increase/decrease size of the maze. Doing so will clear the board so be careful!
3) Draw walls by clicking in the squares above. Once placed, select a wall to remove it.
4) Run selected algorithm to visualize the path as it is searching and the final path taken.
Note: Simply select a new algorithm and run it to visualize the new path without clearing any placed walls.