Assess students' ability to design a maze‑solving robot that finds the shortest path in a grid using breadth‑first search: produce a clear flowchart and readable pseudocode implementing BFS, specify memory‑efficient ways to store the frontier and visited nodes (e.g., compact coordinate encoding, bitmaps, circular queue, parent pointers), give time/space complexity estimates, and describe a practical strategy for dynamic updates when obstacles appear or disappear (local re‑planning, incremental updates or selective full recompute). Include a brief worked example on a small grid and criteria for when to trigger full versus partial replanning.