• Imran Khan
• Shaikh Hammad Sikandar Bakht
• Shaikh Mohd Ashfaque

A Maze is a 2-dimensional representation of intricate walls and passages. We can consider the smallest unit of a maze as a cell. Walls and passages are combination of cells. A passage is an empty space through a maze whereas, a wall is a closed passage (block) in a maze which is inaccessible. Mazes can be of different types like Perfect Maze - which consists of one solution, where Braid and Spiral Mazes have multiple solutions. A Perfect Maze does not have any loops or inaccessible areas just a connection of neighboring cells. In a Perfect Maze there is only one entry point and exit point. That means it has exactly one solution. The primary go to algorithms for generating a perfect maze are Kruskal's algorithm or Prim's algorithm. They both use a Minimum Spanning Tree over the set of cells. Solving a maze manually is a whole different scenario, it requires tremendous amount of time and effort, also as the mazes get more complex it becomes more tedious. There are many computer algorithms used to solve a maze like A* Search Algorithm, Breadth First Search (BFS), Depth First Search (DFS), Dijkstra's Algorithm. However A* is the best for solving a perfect maze due it two major advantages over other algorithms:  Good Heuristic function resulting in lower time complexity.  Less memory requirement.

Maze Generation, Prim’s Algorithm, Maze Solving, A* Search Algorithm

"Maze Theory", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.8, Issue 11, page no.a202-a208, November-2021, Available :http://www.jetir.org/papers/JETIR2111028.pdf

"Maze Theory", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.8, Issue 11, page no. ppa202-a208, November-2021, Available at : http://www.jetir.org/papers/JETIR2111028.pdf