Draw walls, set start (green) & goal (yellow), then click Run
Results
Legend
About Algorithm
Breadth-First Search (BFS)
Explores all neighbours at the current depth before going deeper. Uses a Queue (FIFO). Always finds the shortest path. Time & Space: O(V+E).
CBSE Connection
BFS is the foundation of Reinforcement Learning — the robot explores its environment to find the best path. In RL, instead of hardcoded rewards, the robot learns by trial and error.
Class 9-10: Understanding how AI agents navigate environments — search problems, state space, and goal-based agents.