Procedure 6.11 (Towers Of Hanoi (recursive way) )

Before seeing the solution make sure that you tried enough. Don’t paste the whole code, just find out the logic. If you stuck in trouble, just inform me on comment.

/**Bismillahir Rahmanir Rahim**/

#include <stdio.h>

int tower(int n)
{
    if(n == 1) return 1;
    return 2*tower(n-1)+1;
}
int main()
{
    int n, m;
    printf("Input DISK number (less than 35)\n");
    scanf("%d", &n);
    m = tower(n);
    printf("%d move needs.\n", m);
    return 0;
}