Imagine if lunch never ended
Legend has it that, in the 80s, red-blooded city types in London took a long "working" lunch, then jetted off to New York on the Concorde, arriving just in time for another lunch!
Consider New York and London as graph nodes, aiming to minimize total travel time while visiting all cities in an order that allows consecutive lunches—a classic traveling salesman problem.
Your journey's feasibility depends on how fast you can travel between cities. Choose from presets ranging from standard commercial aircraft to the record-breaking speeds of extreme aviation.
| Preset | Min (km/h) | Max (km/h) | |
|---|---|---|---|
| 13 | 7200 | ||
| 500 | 2200 | ||
| 500 | 900 | ||
All clocks show local time at each location. For example, departing London at 2pm local time and arriving in New York at 12pm local time gives you the perfect consecutive lunch opportunity.
Try starting with: London, New York, Los Angeles
When solutions are found, select any route (click or press Tab + Enter) to visualize your lunch journey on the map.