Puzzle · Computational Thinking

Theme Park Tour Guide

Turn a busy park map into a graph, plan a tour that visits every ride once, prove when no tour is possible, and write rules that find a tour on any map.

What you’ll do

You’re the new tour guide at Lakeside Park. Your visitors want to ride every ride, and they don’t want to walk past the same ride twice. Your job is to plan a tour that starts at the Front Gate, visits every ride exactly once, and ends back at the Front Gate.

How it works

  1. Draw the graph. The park map is full of trees, food stands, and benches. Draw only what a tour guide needs: a dot for each ride and a line for each path between two rides.
  2. Plan a tour. Find a tour on your graph and write it as steps on a route sheet.
  3. Trace it. Trade route sheets with a partner. Follow their steps exactly as written and check that the tour meets every requirement.
  4. Take on harder maps. Find a tour of the full park. Then try the map with the new Sky Ride. If you can’t find a tour, explain how you know no one ever could.
  5. Write an algorithm. Write rules that help find a tour on any map, then test them on a park you’ve never seen.

Afterward

  • What did you leave out when you drew the graph? Why did that make the tour easier to plan?
  • What’s the difference between your route for one map and your rules for any map?
  • How did tracing someone else’s route help you find bugs they missed?
  • Where else do people need routes like these? Think about delivery drivers, school buses, and GPS.

This activity is a remix of Tour Guide by Paul Curzon for Teaching London Computing.

About the designer

Mike Renne

Mike Renne is a computer science and technology educator.

LinkedIn