13 N TOWERS OF HANOI

There are N pegs. Each peg can hold discs in decreasing order of radius when looked from bottom to top of the peg. There are M discs which have radius 1 to M. You are required to do the transformations in minimal number of moves. A move consists of picking the topmost disc of any one of the pegs and placing it on top of any other peg. At any point of time, the decreasing radius property of all the pegs must be maintained.

Write a code to find the minimum number of moves for N pegs & M discs.