What?!? Another really cool readME???
Hi Guys. This is my A* Pathfinding and Heuristics Project using Pycharm. The UI is built so it is easy for the user to build the grid/map it wants to test the algorithm on. Anything that you want to edit about the project can be done in constants. It directly feeds into file name, size of grid, and other things. I started with just doing euclidean distance because I thought it was cooler with more directions, but then I finished my project, and I was bored, so I decided to do manhattan as well. The UI is pretty cool and I'm proud of this project.
Have fun I hope you like my project.
The first time you click the grid, it will make the starting point. The second time, it will create the goal. Then, you can make walls by clicking or clicking and dragging on the screen. It is the same to remove the walls.
If you click 'S', it will save the current layout on the grid.
If you click 'L', it will load the previously saved layout of that grid in the file specified in constants.
If you click 'C', it will clear the displayed grid so you can start over but it does not overwrite what has been saved so you can still load the previous save.
If you click ' ', it will start running the algorithms, alternating between euclidean and manhattan distance. The title of the window will change based on which heuristic algorithm is running. It will show the discovery process and then once done, will highlight the most efficient path. To break from the cycle, simple press ' ' again and you can go back to editing the grid.