This is a three dimensional pathfinding algorithm visualizer project.
A Visualizer for some common pathfinding and machine learning algorithms in 3D.
A live interactive demo can be found here.
Notice how the agent has learned to completely avoid the area south of its starting position because of a cluster of walls. You can change the agent's behaviour for both training and optimal policy visualization by changing the setting in the panel shown below.
Dijkstra’s algorithm (weighted)
The father of pathfinding algorithms, it creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph. As shown in the image below this algorithm does not care to avoid the area around the walls. Guarantees the shortest path!
A* Search algorithm (weighted)
One of the best and a popular technique used in path-finding and graph traversals with heuristic. Guarantees the shortest path!
Breadth-First Search (unwighted)
The algorithm starts at the tree root, and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level. Guarantees the shortest path!
Depth-First Search (unwighted)
The algorithm starts at the root node and explores as far as possible along each branch before backtracking. Does not guarantee the shortest path!
Two methods to generate a maze:
Contributions are welcome. Please feel free to make a PR.
This project was bootstrapped with Create React App.
npm install
npm start
Runs the app in the development mode.
Open http://localhost:3000 to view it in the browser.
Made with ❤️ in React JS