Maze Router: Collected Techniques

ABSTRACT: In this thesis, Maze Router Problem (MRP) solved by using Connected Component Labeling, Depth First Search, Lee and A* Algorithms. The main goal of this research is to find a complete set of path which directs an agent to move from the Source node in the Maze towards a Target node in a Single-layer routing environment. In experiments different sized Maze Router Problem (MRP) instances are solved by using different Algorithms. From the results obtained we can conclude that Lee and A* Algorithms finds the shortest path for all the problem instances. It can also be concluded that A* Algorithm is the fastest Algorithm that finds the shortest path. Keywords: Maze, Maze Router, Maze Router Problem, Connected Component Labeling Algorithm, Depth First Search Algorithm, Lee Algorithm, A* Algorithm. …………………………………………………………………………………………………………………………