RobotC Maze Solver

Also for Mechatronics Design 1, I programmed a Mindstorms robot to explore a maze, store visited cells, and return along the shortest path.

Navigation used NESW directions, a coordinate map in a 4×6 array, and a right-wall-following strategy. After reaching the goal, redundant cells were pruned so the return trip followed the cleaned path in reverse.

The robot completed the maze with the fastest class solution and earned an A+. Up to three human interventions were allowed for maze construction inconsistencies.