What is the Tower of Hanoi?
From Maths for Kids / Maths is Not Boring: The Kids Maths Podcast · 9:20
Show by Kidopoly
Have you ever heard of a magical puzzle that actually solves itself by hiding inside itself?! Join Mira and Finn as they uncover the amazing mathematical secrets of the Tower of Hanoi! Invented in 1883 by a French mathematician who used a funny fake name to sell it, this wooden stacking game is way more than just moving rings from one peg to another. You'll learn its golden rule: never, ever put a big disc on top of a smaller one! But what happens if you have a giant tower of sixty-four golden discs? It would take about 585 billion years to move them all! Discover the mind-bending math magic called "recursion," where a huge puzzle is just a bunch of tiny puzzles stacked together, exactly like wooden nesting dolls. Plus, find out how this exact same mathematical trick lives inside every computer and phone we use today to sort lists, search for things, and even draw beautiful shapes like tree branches and snowflakes. Get ready for a huge brain adventure!
More episodes of Maths for Kids / Maths is Not Boring: The Kids Maths Podcast
More episodes
- What is a Spirograph?
- What is a map projection?
- What is Siteswap?
- What is the hairy ball theorem?
- Who was Euclid?
- What is optimal stopping?
- What is the moving sofa problem?
- What is an inverse?
- What is the game Dobble?
- What is the Fibonacci sequence?
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.