The tower of Hanoi is a puzzle consisting of three pegs mounted on a board and n

Question

 The tower of Hanoi is a puzzle consisting of three pegs 
mounted on a board and n disks of various sizes with holes in their centers, 
stacked from largest to smallest on the first peg. Your objective: to move all 
the rings to the second or third tower. You can only move the top ring on a 
given tower, and you can't place larger rings on top of smaller rings. Write a 
recursive program that solves this puzzle for the number of disks specified by
the user. 

How many disks do you want to have?  3
Move top disk from peg O to D
Move top disk from peg O to S
Move top disk from peg D to S
Move top disk from peg O to D
Move top disk from peg S to O
Move top disk from peg S to D
Move top disk from peg O to D
Press any key to continue . . .

How many disks do you want to have?  5
Move top disk from peg O to D
Move top disk from peg O to S
Move top disk from peg D to S
Move top disk from peg O to D
Move top disk from peg S to O
Move top disk from peg S to D
Move top disk from peg O to D
Move top disk from peg O to S
Move top disk from peg D to S
Move top disk from peg D to O
Move top disk from peg S to O
Move top disk from peg D to S
Move top disk from peg O to D
Move top disk from peg O to S
Move top disk from peg D to S
Move top disk from peg O to D
Move top disk from peg S to O
Move top disk from peg S to D
Move top disk from peg O to D
Move top disk from peg S to O
Move top disk from peg D to S
Move top disk from peg D to O
Move top disk from peg S to O
Move top disk from peg S to D
Move top disk from peg O to D
Move top disk from peg O to S
Move top disk from peg D to S
Move top disk from peg O to D
Move top disk from peg S to O
Move top disk from peg S to D
Move top disk from peg O to D
Press any key to continue . . .

Explanation / Answer

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.