Tower of Hanoi

What is the minimum number of moves to solve the Tower of Hanoi with $6$ disks?

~3 minAnswer checked instantlyRecurrences

Classical — É. Lucas (1883)

Stuck? A gentle nudge

Something off?

Workspace

Your answer

Loading the math keyboard…

Type naturally — sqrt, pi, / and ^ become notation. Any equivalent form is accepted. Press Enter to check.