My new pathfinding algorithm. Use WASD and arrow keys to control the start node (red) and the end node (green). Press on the black circles to change them into obstruction nodes (white) or change them back to blank ones. Press numbers 1-4 for Manhattan, Euclidean, Octile, and Chebyshev heuristics. Press c to clear all obstruction nodes. Press space to run the algorithm. Magenta nodes are part of the path the algorithm creates from the red to the green node. Blue nodes are unvisited nodes. Yellow shows only the path. Purple shows the optimized path.
This video is great for visualizing greedy best first search, a simple pathfinding algorithm that this project is based on: https://www.youtube.com/watch?v=TdHbO3w68fY Also a cool pathfinding simulation: https://qiao.github.io/PathFinding.js/visual/ This pathfinding algorithm corner cuts. (*Note: sometimes the search algorithm makes a really bad(long) path, but the path optimizer will fix it.)
