1. Team Maus Team Members Joe Malo Josh Mele Alaric Bobby Faizaan Mustafa

2. Project Goals 1. Search or wander the maze. 2. Build a map of what it sees. 3. Drop cargo at the end point. 4. Return to start using the shortest path.

3. Commands, Output, Scoring 0 - Go forward one unit 1 - Turn left 90 o 2 - Turn right 90 o 4 - Play sound Getting to the top right corner and then back to bottom left with lowest number of moves

4. Strategy Assigned specific preferences for the robot to follow. Used three difference preference loops to tackle the random mazes. After the robot encountered a box three times it would back track. After five times it would return to the beginning. The idea is to avoid the robot from going in circles.

5. Mapping The robot starts off by making a 5 x 7 matrix of zeros. Makes a one for every box it goes in. Whenever it goes in the same box, it will add another one to that number. For example, if the robot went into a box 3 times, it would be mapped “3.”

6. Conclusion After trying several codes and methods, we found this one to be the most accurate and the fewest moves. The problem we encountered with our other methods, was the preferences didn’t guarantee a successful run. Our robot will always return to the start in the least moves possible.