Skip to content

What is the Travelling Salesperson Problem?

November 8, 2026 · 14 min

Show notes

Imagine you have to deliver birthday invitations to ten friends in your neighborhood. Sounds super easy to find the shortest route, right? Just look at a map and go to the closest house first! But wait—what if we told you that finding the true, guaranteed shortest path is actually one of the most brain-bending mysteries in the entire universe?! Welcome to the Travelling Salesperson Problem! It turns out that for just ten stops, there are over 180,000 different possible routes you could take. And if you want to visit just a few dozen houses, there are more route choices than there are grains of sand on every beach on Earth! Join Mira and Finn as they explore this incredible math monster. Discover how supercomputers took 85 years of brainpower just to find the best route through Sweden, and why nobody in the world knows a quick math trick to solve it every time. Plus, find out how tiny, fuzzy bumblebees with brains the size of a sesame seed can solve this exact same puzzle perfectly! It is time to dive into a massive, invisible math explosion hiding in your very own neighborhood!

All episodes of Maths for Kids / Maths is Not Boring: The Kids Maths Podcast

Settings

Display

Language

Decides which stations you see first on the home page.

History

Recently played stations and episodes and your latest searches are only stored in this browser.

Notifications

A short notice when a podcast you follow has a new episode. Turn off single podcasts with the bell on their page.

Account

Save favorites – in the app and on the website.

Keyboard shortcuts

/
Open search
Space
Play or pause
← →
In the player: back 15 s, forward 30 s (episodes) · in a row: next tile
↑ ↓
In a row: target within the tile
Home / End
In a row: first or last tile
Esc
Close window or menu
?
This overview
Now playing

Go to station page

Play next

    Add episodes with “Play next” – they play after the current episode.