学步园

20081002

递归迷宫求解，代码在Push Box的基础上做了大量改进。

#include <stdio.h>
#include <conio.h>

void printmaze(char status[10][10]);
int search4(char *p);
int gogrid(char *p);

void main()
{
    char status[10][10]=
        {
            {1,1,1,1,1,1,1,1,1,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,0,1},
            {1,0,0,0,0,0,0,0,2,1},
            {1,1,1,1,1,1,1,1,1,1},
        };

    search4(status[3]+1);
    printmaze(status);
    getch();
}

void printmaze(char status[10][10])
{
    int i,j;

    for(i=0;i<10;i++)
    {
        for(j=0;j<10;j++)
            switch(status[i][j])
            {
                case 0:
                    printf(" ");
                    break;
                case 1:
                    printf("■");
                    break;
                case 2:
                    printf("★");
                    break;
                case 3:
                    printf("☆");
                    break;
            }

        printf("\n");
    }
}

int search4(char *p)
{
    *p=3;

    if(gogrid(p-10))
        return 1;

    if(gogrid(p+1))
        return 1;

    if(gogrid(p+10))
        return 1;

    if(gogrid(p-1))
        return 1;
    
    *p=0;
    
    return 0;
}

int gogrid(char *p)
{
    switch(*p)
    {
        case 1:
        case 3:
            return 0;
        case 2:
            return 1;
        case 0:
            if(search4(p))
                return 1;

            return 0;
    }
}