Pathfinding Algorithm Visualization

Website Link: https://mmanoah.github.io/Path-Finding-Visualization/

How To Use

1. The red box with S is the starting node. The green box with G is the goal node.
2. You can change the starting and goal node locations by selecting the appropriate selection in the "Change Node" drop down menu and then click on the location you want on the board.
3. You can add walls by selecting "Wall Node" in the Change Node drop down. Then click down your mouse and drag where you want the walls on the board.
4. You can change the speed of the visualization by selecting a speed in the "Animation Speed" drop down.
5. Use random walls to generate random walls
6. Select an algorithm in the drop down menu.
7. Press Go
8. Reset will clear the board

The Algorithms

Uninformed searches do not have heuristic values while informed searches do.

Depth-First

Depth-First search is an uninformed any-path algorithm, it does not guarantee the shortest path.

Breadth-First

Breadth-First search is uninformed typically any-path algorithm. However in this scenario it does guarantee the shortest path.

Best-First

Best-First search is an informed any-path algorithm, it does not guarantee the shortest path.

Uniform-Cost

Uniform-Cost search is an uninformed optimal-path algorithm, it does guarantee the shortest path.

A*

A* search is an informed optimal-path algorithm, it does guarantee the shortest path.

Built With

• HTML
• CSS
• Javascript

License

This project is licensed under the MIT License - see the LICENSE file for details