piyushp00 / pathfinder

A visualization tool for different pathfinding algorithms

Pathfinder

Pathfinder is a visualization tool that shows how different pathfinding algorithms work. The program's objective is to go from the start cell to the end cell using a pathfinding algorithm. You can draw walls by clicking or holding down the mouse over cells. Once the algorithm has found the start cell, the optimal path will be illuminated in yellow. Additionally, mazes can be generated by selecting an algorithm from the 'Mazes' tab. This project is not suitable for mobiles or older versions of browsers. Google Chrome or Safari work best.

• To view the project, click here https://piyushp00.github.io/Pathfinder
  • Pathfinding Algorithms: A*; Breadth-First Search; Depth-First Search; Greedy Best-First Search; Modified Jump Point Search; Dijkstra.
  • Maze Generating Algorithms: Random (recursive backtracking); Recursive Division; Recursive Division (horizontal skew); Recursive Division (vertical skew); Simple Spiral.