Use the grid to search for a target. The lab watches your choices, separates your final route from search work, then labels the behavior as BFS, DFS, or backtracking.
The interface only constrains legal moves. The search order comes from the player.
Layer expansion maps toward BFS. Branch-following plus returns maps toward DFS/backtracking.
The generated program is executed in-browser so the concept connects back to code.
Arrange operations visually and see why LIFO and FIFO behave differently.
Build a call tree through choices, then watch base cases and returns appear.
Select connected nodes and turn the interaction into traversal logic.