Hello! It’s me again, with a new showcase! This time it’s a pathfinding visualizer. If you never heard of pathfinding visualizers/algorithms, they basically find the most optimal or near optimal path, they move through a grid which can have walls to be a maze. My showcase allows you to draw walls and find near optimal paths using the A* algorithm (arguably the best pathfinding algorithm out there). It’s currently pc-only as it relies on keybinds, maybe I’ll add mobile support (with buttons) later on?
Controls
Left mouse click - Place wall
Left mouse click + left/right control - Remove wall
A - Start A* (clears the path that was produced from the last time, if found)
E - Clear the path that the algorithm found
R - Reset the whole grid (excluding start and end points)
Well that is a thing of beauty. I like it. It would be good if you added instructions on how to clear blocks and what to press for start and Clear. Also show which algorithms are which,
Weeeeeeeeeeeeeeeeeeellllll that’s A* fault not me lmao, I can make it look through everything instead of choosing the first path it finds which would fix that problem but would neglect the thing that makes A* one of it’s kind. That’s one way to break a system tho, lmao, impressive.
