Unsolved |
Solved |
This is a Pathfinder algorithm visualizer. If you're interested in learning more about this I recommend this wikipedia article, but basically, there are some algorithms that can be used to find the most optimal path between two nodes. This visualizer allows you to setup some nodes in a grid and build some obstacles, and let the program calculate the most optimal path. For now, only implements the A* Search Algorithm, but I'll add more in the future!
- Select an algorithm
- Draw
Starting
andTarget
nodes - Draw
Wall
nodes - Press Visualize!
- A* Search
- Dijkstra's π§WIPπ§