Generates a random maze and finds shortest path (if there is a path) using the Breadth First Search algorithm. Turbo Mode (shift + green flag) recommended unless you want to see it work out the path. A Depth First Search block also exists. It won't find the shortest path but it will find a path if there is one. BUG: it starts in the lower left corner but sometimes when it's boxed in it'll jump to the lower right corner & search from there, and then the traceback won't work properly
Moore, Edward F. (1959). "The shortest path through a maze". Proceedings of the International Symposium on the Theory of Switching. Harvard University Press. pp. 285–292. As cited by Cormen, Leiserson, Rivest, and Stein. (Previously also invented by Konrad Zuse)
