Hanoi Tower Problem--recursive implementation

/* Hanoi Tower Problem */#include <stdio.h> #include <stdlib.h>//defines n as the number of layers to move, X, y, and Z represent three pillars, which means moving the top N-level tower from X to zvoid move ( int N,char X,char Y,char z) {    if (n = = 1)    {        printf ("moved from%c to%c \ n", x,z);    }    else    {        move (n-1,x,z,y);        printf ("Move from%c to%c \ n", x,z);        Move (n-1,y,x,z);}    } int main () {    int m;//   char x, y, Z;    printf ("Please enter the number of layers: \ n");    scanf ("%d", &m);    Move (M, ' X ', ' Y ', ' Z ');}

　　

Hanoi Tower Problem--recursive implementation