迷宫求解算法

原文出处：
http://blog.csdn.net/gzzheyi/article/details/6686351
Status MazePath(MazeType (*Maze)[MAX],PosType start,PosType end)
{
    SElemType   e ;
    MazeStack S ;
    PosType curpos ;

    int curstep ;

    InitStack(&S) ;     //初始化栈

    curpos = start ;  // start.x= start.y = 0

    curstep = 1 ;

    do
    {
        if(Pass(curpos,Maze))
        {
            FootPrint(curpos,Maze) ;
            e.di = 1 ;
            e.seat = curpos ;
            e.ord = curstep ;

            Push(&S,e) ;

            if(curpos.x == end.x && curpos.y == end.y )
            {
                PrintMaze(Maze) ;
                return TRUE ;
            }  //if

            curpos = NextPos(&curpos,1) ;
            curstep++ ;

        } //if

        else
        {
            if(!StackEmpty(S))
            {
                Pop(&S,&e) ;

                while(e.di == 4 && !StackEmpty(S))
                {
                    MarkPrint(e.seat,Maze) ;
                    Pop(&S,&e) ;
                }  //while

                if(e.di <4)
                {
                    e.di++ ;
                    Push(&S,e) ;
                    curpos = NextPos(&(e.seat) ,e.di) ;
                } //if
            } //if
        }  //else
    }while(!StackEmpty(S)) ;   //while


    PrintMaze(Maze) ;

    return FALSE ;

} // MazePath