Assess students' ability (Grade 6–8) to design a maze‑solving algorithm for a simple wheeled robot with limited sensors (e.g., front/left/right bump or proximity) and very limited memory (finite number of states, no map). Require readable pseudocode, a finite‑state diagram with labeled transitions, and at least three test cases (including a dead‑end, a loop, and a branching path) with step‑by‑step traces; grade on correctness, loop avoidance, state minimization, and clarity.