Abstract — A maze always has a way out but finding its way out or finding the destination in the maze is always a challenging task. There are many algorithms that can be used to search the destination node in the maze but which algorithm is going to find the destination node faster. This is what we are going to survey in this paper using some visualization and comparing the algorithms one by one. Some algorithms are fast but cannot provide the shortest route and some provide the shortest route but are really slow. The maze algorithm is first processed over the grid. A specific path finding algorithm is later used to get the shortest path from source node to destination node. The "10X10" grid is used here to learn the functionality of all path finding algorithms.

Keywords: Path Finding Algorithms, uninformed, BFS, DFS, A algorithm.

| DOI: 10.17148/IARJSET.2022.96130