Assess students' ability to design a block‑based A* pathfinding solution for a 10×10 maze game suitable for Grade 6–8 (advanced). Require selection and justification of a heuristic (e.g., Manhattan vs. Euclidean), clear management of open/closed lists (data structures, tie‑breaking, node records), concise pseudocode or flowchart adapted to discrete 10×10 blocks, a traced worked example on a small maze, and proposed speed/memory optimizations with time and space complexity estimates. Keep responses focused, practical, and evidence-based.