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)
-
Notifications
You must be signed in to change notification settings - Fork 0
notayush000/Maze-Solver
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Maze Solver using AI