Students explore pathfinding algorithms through an unplugged grid activity, implement a simplified shortest-path algorithm in block or text-based code, and connect their work to real-world robotics and GPS navigation β aligned to CSTA 2-AP-10, 2-AP-11, and 2-DA-07.
Students will be able to:
Evaluated on correct path traces, accurate cost calculations, and algorithm identification
Scored on correct logic flow, proper decision diamond usage, and connection to code
Does the robot successfully navigate? Does the student explain WHY their approach works or fails?