DONGHO KANG dongho@mit.edu
Junior, Course 6-3 (CS)
 
DAVID J. KIM

djkim@mit.edu

Sophomore, Course 6-3 (CS)  


Strategy

Our strategy was simple, at least we thought it was. We tried to keep it simple, but it turned out to be fairly omplicated. First, we oriented ourselves as quickly as possible using led/phototransistors, then in our primary strategy we headed for the opposition's ball and took it back to our side.

Next came our secondary strateghy where we we checked our IR beacons to decide which path to take to get the second ball in the opposition's side. If the other robot was on our side, we would go to the opposition's side through the path that we took previously. If the robot was not on our side, we went the other way through the location that the other robot started at.

Then, in our final strategy, we sweeped the opposition's side and came back to our side, avoiding the other robot. We looped this process until 60 seconds passed. Unfortunately, we could only reliably execute our primary strategy. Well, not completely reliable, because the failure of this primary strategy proved to be our downfall in the final rounds.

Code

Here is our code: start.c