Implementation of A*, DFS, BFS, GBFS search algorithms using JavaScript.
This project helps to understand how these algorithms work and how do they compare to each other. The program applies these algorithms to find solution of different mazes.
'I' represents the initial state/node whereas 'G' represents the goal state/node.
Enter Maze No: 1 OR 2 OR 3
Show Solution OR Explored Nodes (S OR E)
Enter Algorithm No: 1. A*, 2. BFS, 3. DFS, 4.GBFS
Demo URL: https://m-adil-as.github.io/AI-Search
