The tower of Hanoi puzzle with n (n > 1) different dimensional disks stacked on peg A in the decreasing order of their size with largest dimensional disk at the bottom and smallest dimensional disk at the top.
The disks are to be transferred from peg A to Peg B using peg C with one disk at a time such that under no circumstance larger disk should be stacked on smaller disk. The total between attributes number of disk transfers is given by
- 2T(n − 1) +2
- 2T(n-1) + 1
- T(n-1) +T(n − 2)