1. Nuffield Free-Standing Mathematics Activity
Sight-seeing tour
© Rudolf Stricker

2. Sight-seeing tour
Many cities have sightseeing tours for their tourists.
How do you decide on the route for a sightseeing tour?
Think about ...
Do you want to travel between places of interest by the shortest route?
Is the route itself of interest?
Do you want the route to be of the shortest possible distance or the shortest time?

3. Sight-seeing tour
ccKenneth Allen
To solve this type of problem you may need to use the ...
Chinese Postman Algorithm to minimise the distance travelled when every edge of a network needs to be visited
Travelling Salesman Algorithm to minimise the distance travelled when every vertex of a network needs to be visited

4. Reflect on your work
Describe your approach to this problem. Which algorithm(s) did you use?
How can you evaluate your route to decide if you have found the best possible tour?
© Nuffield Foundation 2012