Maze Solver using AI Search Algorithms Developed a basic Maze solver which finds a path from Start node (S) to Goal Node (G) and compares the time difference between different AI Search Algorithms such as BFS (Breadth First Search), DFS (Depth First Search), UCS (Uniform Cost Search)