This search algorithm will find a guarenteed shortest path from the start node to the end node. To start, select the Start Point button above and click a square on the grid. Next, select the End Point button and click a different square on the grid. Then, hit run. The orange squares are the cells that the algorithm searched while the blue squares are the cells in the path from start to finish. The blue path is guarenteed to be a shortest path but there will sometimes be many shortest paths.
You can click and drag while the Wall button is selected to add obstacles for the algorithm to navigate around. Alternatively, you can click the drop down menu titled Custom Walls and select a frequency and it will generate Walls placed randomly at that frequency. In the drop down menu there are also 2 preset wall patterns to try.
Checking the box that says Allow Diagonals will enable diagonal path finding in the algorithm. This generates much shorter paths.