Delay in ms:
The way BFS works, you can click on any cell which was scanned already ( any visited cell and it will show you the shortest path from there to start :)
If you want to click on more cells, you can scan all remaining cells
is an algorithm which can be used for solving mazes.
It is guaranteed to show the shortest path (unlike DFS), if there is one (meaning there is a way between points A and B).