ClassS04CS141/ChallengeProblem2

Top | ClassS04CS141 | recent changes | Preferences

Challenge problem 2

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.


Top | ClassS04CS141 | recent changes | Preferences
This page is read-only | View other revisions
Last edited April 7, 2004 3:04 pm by Neal (diff)
Search: