I recently created a path finding visualizing project that allows users to see the inner workings of popular path finding algorithms in action. The project includes a user-friendly interface that allows users to specify a starting and ending point on a grid, and then select a path finding algorithm to see how it navigates from the start to the end.

 

The project includes several popular algorithms such as A* and Dijkstra's, as well as more advanced ones like Theta* and Jump Point Search. As the algorithm runs, users can see the steps it takes to find the shortest path from the start to the end, and can also adjust the parameters of the algorithm to see how it affects its performance.

 

One of the key features of the project is its ability to visualize the process of each algorithm in real time. As the algorithm runs, it highlights the cells it has visited, the ones it is currently exploring, and the final path it has found. This allows users to get a better understanding of how the algorithm works, and how it makes decisions as it navigates the grid.

 

Overall, this project was a great learning experience for me and has helped me better understand the inner workings of path finding algorithms. I hope that others can also use it to gain a deeper understanding of these algorithms and how they can be used in various applications.