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. (i am aware that the algorithms search is very similar the the dijkstra one i posted but trust me they are different :p)
I recently learned about the A* algorithm. watched some videos and tuorials to learn it. i built this visualizer that shows how the algorithm explores. the A* algorithm is a pathfing algorithm that finds the shortest path in a relatively short amount of time. its logic is a combination of the dijkstra and best first search. it thinks about the cost it took to get to a position and also uses the h value (distance) making A* the fastest and most effecient pathfinding algorithm. #games #games #games #games #games #games #games #games * **************************************************************************************
