1. Aumm-e-hani munir Maria umer Rakhshanda batool Faiza

3.  DEFINATION: The Tower of Hanoi is one of the truly classic puzzle games. In the Tower of Hanoi puzzle a player attempts to move a large pile of disks, known as the Tower, from the leftmost peg to the rightmost on the puzzle board.  RULES: The rules of the puzzle state that the player can only move one disk per turn and can never place a larger disk onto a smaller one at any time.  TYPE: Tower of Hanoi Puzzles may consist of any number of disks as long as they total three or more.

4.  Lets start with three disk

12.  FUNCTION MoveTower(disk, source, dest, spare): IF disk == 0, THEN: move disk from source to dest ELSE: MoveTower(disk - 1, source, spare, dest) // Step1 above move disk from source to dest // Step 2 above MoveTower(disk - 1, spare, dest, source) // Step 3 above END IF

13.  Another way to visualize what happens when you run MoveTower is called a call tree. This is a graphic representation of all the calls. Here is a call tree for MoveTower(3,A,B,C).

15.  we will consider the state at the top of the figure the starting state.  In this case all three disks are on the left- most peg. And we will consider the state at the bottom right to be the goal state.  Three disks are now all stacked on the right- most peg.

16. Thanks for your patience Have a nice day……..