What is the Travelling Salesperson Problem?

Episode 908

0:00-13:41

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!

Publisher

Maths for Kids / Maths is Not Boring: The Kids Maths Podcast

Published

November 8, 2026

Duration

14 min

Format

Podcast

Category

Lifestyle · Education for Kids

Source

RSS feed

Host

Kidopoly

MF

Maths for Kids / Maths is Not Boring: The Kids Maths Podcast

@mathsforkidsmathsisnotboring

#travellingsalespersonproblem #educationforkids

The Nile