Maze Routing – Lee’s Algorithm

Lee’s Algorithm guarantees there is exists a valid path and it’s the shortest path.

But, this algorithm is too time and memory consuming, To overcome, these short-comings, there are other more advanced algorithms like Line search Algorithm, Steiner Algorithms, etc.

Continue reading