This is a demo of the A* (A star) pathfinding algorithm. - Press the green flag to start and enter a side length from 2-20 - Click on any 2 squares to place start and finish flags - Click and drag to place or remove walls (the algorithm can traverse diagonals) - Press space to start the demo - The algorithm will find the shortest path possible from the start to the finish (indicated in purple) - Press the flag again to start over Enjoy!
Sebastian Lague's videos helped me in implementing this algorithm
