Day+Four+NXT

=It is showtime!=

__ Android App. Robot Competition __ (hint: numbering the cities on your map may help in making your plans)

=**__ Competition One: Shortest Path __**= Remember: The tree with the shortest paths from a given node/vertex/city (same starting point and edges may be revisited for separate paths). Starting at Brasilia, drive your robot to each of the other seven cities. You must drive along an existing path. When you reach each city, you must pick up your robot and place it back at Brasilia to begin your next visit. Use the RED marker. You have finished when each of the other seven cities have been visited. // Your Plan: //

=**__ Competition Two: Minimal Spanning Tree __**= *Remember: the tree with the shortest path and a connection to every node eventually (each edge is only counted once). Choose your starting city. Have your robot trace a minimal spanning tree. You may pick up your robot and place it back on a previously visited city (if you choose to) but you may not drive over a previously driven edge/road. You may only use existing paths. Use the BLUE marker. You have finished when all cities have been visited. // Your Plan: //

=**__Competition Three: Traveling Saleperson with eight cities __**= TSP is a minimization problem starting and finishing at a specified node/vertex/ city after having visited each other node/vertex /city exactly once and returning to the original node/vertex/city. Choose your starting city. Have your robot trace a complete cycle visiting each city exactly once using existing paths. Note: this means edges can be used at most once. Use the GREEN marker. You have finished when you have returned to the original city after visiting each of the other cities. // Your Plan: //