Algebra Problem 11
Tower of Hanoi

The Tower of Hanoi puzzle has three pegs, with a stack of disks on peg A.  The object is to move all of the disks to another peg.  You may move only one disk at a time.  Also, a larger disk may never be put on top of a smaller disk.

Show the moves you will need to take to move five disks to peg C.


Warning!
This images shows only 3 disks.  You have to move 5 disks to solve the problem.

Math Scoring Guide
Download the Oregon Math Scoring Rubric 
Name: ________________________ Period: ____
Teacher: ______________________

Date: ___/____/___
CU - Conceptual Understanding 1 2 3 4 5 6

Comments:
PS - Processes & Strategies 1 2 3 4 5 6

Comments:
V - Verification 1 2 3 4 5 6

Comments:
C - Communication 1 2 3 4 5 6

Comments:
ACC - Accuracy 1     4 5  

Comments:
___ May be revised and returned for an improved score.