You have to move a stack of decreasing disks to another of the 3 rods, where you can only move the top tile, and you cannot stack larger tiles on top of smaller ones. You can prove that the minimum of moves are \(2^n-1\). The number of extra moves it takes per disk is \(1+2^n-1\), this proves the theorem by induction.
- zachstarCurvesWeMostly2020
Backlinks:
[[Mathematical Induction