Tower of Hanoi

this problem is a mathematical puzzle which consists of three towers one have a stack of rings in sorted manner from large to small disk ascendingly the task is to move them from source tower to destination tower with help of auxilary tower with those rules

only one disk can be moved at a time.
a disk can only be moved if it is the uppermost disk on a stack.
no disk may be place on top of a smaller disk

Tower of hanoi gif

the pseudo code to solution:

for n disks can be solved in (2^n -1) steps