A visual pathfinding program that allows the user to create their own obstacles or mazes and then run different pathfinding algorithms on it.
This program includes the ability to place weighted path nodes, the ability to generate a random maze using Prim's algorithm, a results display after each successful path found, and five different algorithms to choose from.
This project was built with inspiration from my introduction to artificial intelligence class, and is meant to be a learning resource for visualizing how different pathfinding algorithms work.
This website is still under production. Next features include more demo videos for each algorithm, along with a more detailed description of each algorithm.
Check out the code here!
Guarantees the shortest path using heuristics and distance calculations. (Weighted)
Guarantees the shortest path using distance calculations. (Weighted)
Does not guarantee the shortest path, only uses heuristics. (Weighted)
Guarantees the shortest path using a queue. (Unweighted)
Depth First Search is a non-weighted algorithm that does not guarantee the shortest path. The algorithm starts at the root node (the green square in our case) and explores as far as possible along each branch before backtracking. Depth First Search uses LIFO (stack) to hold its next nodes. The order for traversal is up, right, down, left.
Generates a maze with one unique solution.