BFS and DFS on a grid

Kestrel Freight's robots need the fewest moves to a shelf, and every aisle they can still reach. Breadth first search spreads in rings with a queue and finds the fewest moves; depth first search dives with a stack and reaches everything. The lecture runs both on the same floors step by step, shows why BFS's first visit is the shortest, what both cost, and the classic mistakes.