step 1. place walls: [LEFT CLICK]. once done, press [SPACE] to do the next step. hold [X] and click on the walls you want to delete. step 2. place starting point: [LEFT CLICK]. once done, press [SPACE] to do the next step. step 3. place end point: [LEFT CLICK]. once done, press [SPACE] and watch.
Pathfinding algorithms are something I thought was cool and always wanted to make one but I find the logic difficult to understand. Originally, I was thinking of watch the tutorial done by griffpatch but I can do better than that, I thought. I read and watched a bunch of articles and videos explaining it and coded the same algorithm with C#. I choose to make the Dijkstra algorithm bc it’s rlly easy to understand and it always returns the shortest path. It was only later that I found out the tutorial griffpatch did was basically dijkstra :/ yeeeaaahhhh I should have just watched his tutorial from the start :p anyways, people have helped me with making this so to give back to my community, I built this visualizer to help you better understand the logic of pathfinding algorithms :) #games #games #games #games #games #games #games
