Give a proof that any legal sequence for moving n discs from one peg to another in the Towers of Hanoi puzzle takes at least 2n-1 moves.
Submissions are due by April 11, 5pm.