C程序设计语言--使用GCC(13)

    发布一个汉诺塔游戏程序，在win平台上的GCC编译通过。使用A键和D键左右移动，使用S键拿起或放下汉诺塔棋子。输入>键会显示算法步骤。因为linux上不支持getch函数，暂没能移植。

#include<stdio.h>
// #include<windows.h>
#define TRUE 1
#define FALSE 0
#define MAX 6
#define ON_A 1
#define ON_B 2
#define ON_C 3
int a_tower[MAX+1], b_tower[MAX+1], c_tower[MAX+1];
int *a_top = &a_tower[MAX], *b_top = b_tower, *c_top = c_tower;
int now_status = ON_A;
int catch_status = FALSE;

int main()
{
    char c;
    int max_num = MAX;
    init_hanoi(max_num);
    printf("\n\n\n\n\n\n\n\n\n\n");
    show_hanoi();

    while(1){
        while(catch_status == FALSE) {
//            Sleep(100);
            c = getch();
            if(c == 'd'){
                switch(now_status) {
                    case ON_A: now_status = ON_B; break;
                    case ON_B: now_status = ON_C; break;
                    case ON_C: now_status = ON_A; break;
                }
                show_hanoi();
            }
            else if(c == 'a'){
                switch(now_status) {
                    case ON_A: now_status = ON_C; break;
                    case ON_B: now_status = ON_A; break;
                    case ON_C: now_status = ON_B; break;
                }
                show_hanoi();
            }
            else if(c == 's') {
                catch_status = TRUE;
                show_hanoi();
                break;
            }
            else if(c == '>') {
                dohanio(max_num,'A','B','C');
                printf("\n\n\n\n\n\n\n\n");
                break;
            }
        }

        while(catch_status == TRUE) {
//            Sleep(100);
            c = getch();
            if(c == 'd'){
                switch(now_status) {
                    case ON_A: a_to_b(); now_status = ON_B; break;
                    case ON_B: b_to_c(); now_status = ON_C; break;
                    case ON_C: c_to_a(); now_status = ON_A; break;
                }
                show_hanoi();
            }
            else if(c == 'a'){
                switch(now_status) {
                    case ON_A: a_to_c(); now_status = ON_C; break;
                    case ON_B: b_to_a(); now_status = ON_A; break;
                    case ON_C: c_to_b(); now_status = ON_B; break;
                }
                show_hanoi();
            }
            else if(c == 's') {
                catch_status = FALSE;
                show_hanoi();
                break;
            }
            else if(c == '>') {
                dohanio(max_num,'A','B','C');
                printf("\n\n\n\n\n\n\n\n");
                break;
            }
        }

    }
    return 0;
}

int a_to_b()
{
    if((a_top == &a_tower[0]) || (b_top == &b_tower[MAX]) || (*b_top < *a_top)) {
        catch_status = FALSE;
        return 0;
    }
    b_top++;
    *b_top = *a_top;
    *a_top = 0;
    a_top--;
    return 0;
}

int a_to_c()
{
    if((a_top == &a_tower[0]) || (c_top == &c_tower[MAX]) || (*c_top < *a_top)) {
        catch_status = FALSE;
        return 0;
    }
    c_top++;
    *c_top = *a_top;
    *a_top = 0;
    a_top--;
    return 0;
}

int b_to_a()
{
    if((b_top == &b_tower[0]) || (a_top == &a_tower[MAX]) || (*a_top < *b_top)) {
        catch_status = FALSE;
        return 0;
    }
    a_top++;
    *a_top = *b_top;
    *b_top = 0;
    b_top--;
    return 0;
}
int b_to_c()
{
    if((b_top == &b_tower[0]) || (c_top == &c_tower[MAX]) || (*c_top < *b_top)) {
        catch_status = FALSE;
        return 0;
    }
    c_top++;
    *c_top = *b_top;
    *b_top = 0;
    b_top--;
    return 0;
}

int c_to_a()
{
    if((c_top == &c_tower[0]) || (a_top == &a_tower[MAX]) || (*a_top < *c_top)) {
        catch_status = FALSE;
        return 0;
    }
    a_top++;
    *a_top = *c_top;
    *c_top = 0;
    c_top--;
    return 0;
}

int c_to_b()
{
    if((c_top == &c_tower[0]) || (b_top == &b_tower[MAX]) || (*b_top < *c_top)) {
        catch_status = FALSE;
        return 0;
    }
    b_top++;
    *b_top = *c_top;
    *c_top = 0;
    c_top--;
    return 0;
}

int show_hanoi()
{
    int i;
//    printf("\t\t\t\t------Hanoi------\n");
    for(i=1; i<now_status; i++)
        printf("\t");
    if(catch_status == FALSE)
        printf("\t\t\t\t*\n");
    else
        printf("\t\t\t\t!\n");
    for(i=MAX; i>0; i--)
        printf("\t\t\t\t%d\t%d\t%d\n",a_tower[i], b_tower[i], c_tower[i]);
    printf("\t\t\t\tA\tB\tC");
    printf("\n\n\n\n\n\n\n\n\n\n\n");
    return 0;
}

int init_hanoi(int max_num)
{
    int i;
    for(i=1; i<=MAX; i++,max_num--)
        a_tower[i] = max_num;
    a_tower[0] = b_tower[0] = c_tower[0] = 100;
    return 0;
}

int  dohanio(int n,int a,int b,int c)
{
    if(n==1)
        printf("%c->%c ",a,c);
    else    {
        dohanio(n-1,a,c,b);
        printf("%c->%c ",a,c);
        dohanio(n-1,b,a,c);
    }
    return 0;
}