The Hanoi Towers Recursive

Hey guys, ive just been doing this coding but im very lost at the debuggings, just can somone help me, tell me whats wrong and debug it. I tried the debugging for a bout an hour and as a newbie its hard to tell where my problem is.

It is suposed to be in recurssion and tel the use what steps to take to solve the hanoi problems.

Here is the Code

Code:

`#include <stdio.h>`

#include <conio.h>

#include <ctype.h>

#include <math.h>

double Hanoi (int numdisks, int start, int goal, int temp);

main()

{

int num, steps, start, temp, goal, numdisks;

start = 1;

temp = 2;

goal = 3;

printf (" Welcome T0 Kavi'S Towers Of Hanoi\n");

printf("\nEnter a number to calculate the steps for the Towers Of Hanoi:

");

scanf("%d",&num);

while (num < 1 || num > 15 )

{

printf ("disks Have to be above 0 and under 12 Re Enter

Value: ");

scanf("%d",&num);

}

steps = pow(2,num)- 1 ;

num = numdisks

printf("\n Number of steps is: %i ",steps);

printf("\n Move Disk from Peg %i to Peg %i", Hanoi (numdisks, start,

goal, temp);

fflush(stdin);

getch();

return 0;

}

{

Hanoi (numrings,start,goal,temp)

if numrings = 1

printf ("move a disk from "start" to "goal")

else

Hanoi (numrings-1, start, temp, goal)

Hanoi (numrings 1, start, goal, temp)

Hanoi (numrings-1, temp, goal, start)

}