ClassS04CS141/ChallengeProblem2

ClassS04CS141 | ClassS04CS141 | recent changes | Preferences

Showing revision 1

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 Wed April 14, 5pm.


ClassS04CS141 | ClassS04CS141 | recent changes | Preferences
This page is read-only | View other revisions | View current revision
Edited April 7, 2004 2:44 pm by Neal (diff)
Search: