🧩 Puzzle · Apply BFS
Spread the search
Explore this graph from A the way breadth-first search does: always visit the nearest unvisited node before any farther one. The amber nodes are the frontier — the only legal moves right now.
Start = A · visit every node in BFS order
A is visited. Click the next node BFS would reach — always the nearest unvisited one.
Amber = reachable now (the frontier). Green = visited.visited 1/7