Paper Airport
Plan a legal connection through a small fictional timetable. The earliest departure does not always deliver the earliest arrival.

Set the scene
Publish four flights in one time zone: Home–Lake 9:00–9:35, Home–Hill 9:05–9:25, Lake–Bay 9:40–10:00, Hill–Bay 9:40–10:05. Require ten minutes between arrival and onward departure.
How to play
- Teams privately select a route from Home to Bay and write its connection length. Give everyone one minute before allowing discussion.
- Invite one team to defend the earliest-looking route and another to audit it. Lake allows only five minutes; Hill allows fifteen and reaches Bay at 10:05.
- Give a point for the valid route and another for correctly rejecting the shorter arrival. Finish by changing just one published time to make Lake feasible.
Host’s note
Keep every time in one format. A ten-minute connection meets the rule exactly; clarify that boundary before handing out the schedule.
Try a variation
Add a direct 9:20–10:10 flight and a preference for no transfers. Ask teams to explain how the answer changes with the traveler's priority.
More in this collection
TabletopTwin Titles
Two independent title writers see the same invented scene. Teammates try to infer the common scene from the two titles alone.
TabletopMap from Memory
Reconstruct an invented neighborhood after a quick look. Accurate connections count even when landmarks are drawn as plain boxes.
TabletopOne-Letter Workshop
Connect two words through valid intermediate steps, changing one written unit at a time. A short chain is easy to verify together.