Tower of Hanoi in C++ using recursion

Tower of Hanoi

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower) is a mathematical game or puzzle It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

1.    Only one disk may be moved at a time.

2.    Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.

3.    No disk may be placed on top of a smaller disk.

With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2ⁿ - 1, where n is the number of disks. 

Program:-

output:-

       Enter number of disks      :     3

       Moving disk d1 from d1 to d3

       Moving disk d2 from d1 to d2

       Moving disk d1 from d3 to d2

       Moving disk d3 from d1 to d3

       Moving disk d1 from d2 to d1

       Moving disk d2 from d2 to d3

       Moving disk d3 from d1 to d3

note:- for more details click here  . Definition and image is taken from the wikipedia.