PROOF 182
Prove.
The minimum number of moves for the Tower of Hanoi is 2ⁿ−1
On the natural numbers ℕ.
Definition D1
Given a sequence of moves that transfers n disks of pairwise distinct sizes from one peg to another while obeying the rules, let M(n) denote the smallest such length.
Proof.
Related labs