Skip to content
World 4 · Towers of Hanoi and Recursion · 9 min · PRO

Two to the n, minus one: counting the moves

From the recursion to a formula

PRO · Puzzle Algorithms Lab

World 4: Towers of Hanoi and Recursion is part of PRO

The first world of Puzzle Algorithms Lab is free. PRO opens the other 25 lessons in 6 worlds — simulations, quizzes and all.

  • Three pegs, one rule: the puzzle
  • Recursion: solving a problem by solving a smaller one
  • The legend of 64 discs: when exponential means impossible
  • Shortest path on a grid: from BFS to weights
  • Dijkstra: always expand the cheapest
PRO includes
  • All 60 labs — every world, every lesson
  • Practice exams and certificates

$8.33/mo, billed yearly ($99.99) · or $39.99 monthly

Unlock Puzzle Algorithms LabTry the free world
My notes
Only saved in this browserAll my notes →
← Recursion: solving a problem by solving a smaller oneThe legend of 64 discs: when exponential means impossible →

Report a mistake

What is wrong?
0 / 2000 · at least 10 characters
Sent along with your report
  • Page
  • About Two to the n, minus one: counting the moves — Puzzle Algorithms Lab · puzzles/two-to-the-n-minus-one
Plus your browser type. Reports go to our support system; see the privacy notice.