The robot that we have to build is a lego NXT robot that shall be the winner of the snake-game competition.
Before this competition, we have to complete three elementary tasks that help us to better understand the NXC (Not eXactly C) language and to make the final task more and more easier: the first one is to make our robot navigate randomly in the stadium without touching the borders. In the second task, our robot have to find the ball in a predefined position, and to take it back to the initial position. The third task aims also to find a ball and take it back, but in this time, the ball is randomly placed in the stadium.
After completing these three tasks, we are now able to enter the competition. The snake consists of one leader and n followers. Given a protocol for communication between robots via Bluetooth, our robot shall be able to be the leader or a follower. The competition consists of two parts: - the first competition is a 2-robot snake competition, i.e there is one leader and one follower. In the stadium there are only two red/blue balls placed at a predefined locations. - However, the second competition is a 3-robot snake competition, i.e there is one leader and two followers. The stadium of the second competition is, as expected, bigger than the stadium of the first one. There are four red/blue balls placed at a predefined locations, and other red/blue balls may be randomly placed.