迷宫探路II

    对《迷宫探路》做了一点改进。小人在行走过程中不走回头路,

即不重复经过同一点。                     

/* crazymaze.c*/
/* 2003-8-26 */
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <graphics.h>
#define N 22
#define M 22
#define MAXLEN 200;
int bg[M][N];
struct square{
    int x;
    int y;
    int direc;
}p[200];
void makebg(int,int);
void drawbg(int[][],int,int,int,int,int);
void drawman(int,int,int);
void rect(int,int,int,int);

void main(){/* main()开始 */
int step=20;
int len=10;
int size=20;
int x=0,y=0,x0=0,y0=0;
int i=0,j=0,k=0,count=0;
int gdriver=DETECT,gmode;
char ch;
int direc;
makebg(M,N);
/*  registerbgidriver(EGAVGA_driver);
 initgraph(&gdriver,&gmode,"c:\\turboc2");*/
initgraph(&gdriver,&gmode,"c:\\tc20\\bgi");
cleardevice();
setwritemode(XOR_PUT);
settextstyle(1,0,3);
setcolor(GREEN);
outtextxy(100,180,"Press <Q> to quit");
setcolor(BLUE);
setfillstyle(LINE_FILL,BLUE);

drawbg(bg,M,N,size,0,0);
setcolor(GREEN);
outtextxy(60,120,"PRESS KEY <1> :YOU ,");
outtextxy(70,150,"OTHER KEY :AUTOMATIC");
setcolor(WHITE);
x+=len;y+=len;
drawman(x,y,len);
x0=x;y0=y;
if((ch=getch())=='1'){
/* 人工控制 */
while((ch=getch())!='q'){
  delay(800);
  drawman(x,y,len);
  switch(ch){
    case 'a':
        if(j>0&&bg[i][j-1]==0){
            if(x>step){x-=step;j--;};
        }
        break;
    case 's':
        if(i<M-1&&bg[i+1][j]==0){
            if(y<479-step){y+=step;i++;};
        }
        break;
    case 'd':
        if(j<N-1&&bg[i][j+1]==0){
            if(x<639-step){x+=step;j++;}
        }
        break;
    case 'w':
        if(i>0&&bg[i-1][j]==0){
            if(y>step){y-=step;i--;}
        }
        break;
    default :break;
  }
  drawman(x,y,len);
 if(i>=M-1&&j>=N-1){
    settextstyle(4,0,3);
    setcolor(RED);
    outtextxy(150,260,"YOU WIN!");
  }
  setcolor(WHITE);
}
 closegraph();
}/* 人工控制结束 */

else{
/* 电脑控制 */
/* direc表示上一步运动方向 */
/* 并表示下一步运动方向 */
/* 0~3分别表示 西、北、东、南 */

direc=2;
i=j=0;k=0;
while(i<M-1||j<N-1){
    switch(direc){
    case 0:
        /* 以3,0,1,2的次序尝试 */
        if(i<M-1&&bg[i+1][j]==0){
            y+=step;i++;
            direc=3;
        }
        else if(j>0&&bg[i][j-1]==0){
            x-=step;j--;
            direc=0;
        }
        else if(i>0&&bg[i-1][j]==0){
            y-=step;i--;
            direc=1;
        }
        else {
            x+=step;j++;
            direc=2;
        }
        p[k].x=x;
        p[k].y=y;
        p[k].direc=direc;
        if(k>0){
            count=k-1;
            while(count>=0
            &&(p[count].x!=p[k].x||p[count].y!=p[k].y))
            count--;
            if(count>=0){
                k=count;
                p[k].direc=direc;
                i=(p[k].y-len)/step;
                j=(p[k].x-len)/step;
            }
        }
        k++;
        break;
    case 1:
        if(j>0&&bg[i][j-1]==0){
            x-=step;j--;
            direc=0;
        }
        else if(i>0&&bg[i-1][j]==0){
            y-=step;i--;
            direc=1;
        }
        else if(j<N-1&&bg[i][j+1]==0){
            x+=step;j++;
            direc=2;
        }
        else{
            y+=step;i++;
            direc=3;
        }
        p[k].x=x;
        p[k].y=y;
        p[k].direc=direc;
        if(k>0){
            count=k-1;
            while(count>=0
            &&(p[count].x!=p[k].x||p[count].y!=p[k].y))
            count--;
            if(count>=0){
                k=count;
                p[k].direc=direc;
                i=(p[k].y-len)/step;
                j=(p[k].x-len)/step;
            }
        }
        k++;
        break;
    case 2:
        if(i>0&&bg[i-1][j]==0){
            y-=step;i--;
            direc=1;
        }
        else if(j<N-1&&bg[i][j+1]==0){
            x+=step;j++;
            direc=2;
        }
        else if(i<M-1&&bg[i+1][j]==0){
            y+=step;i++;
            direc=3;
        }
        else {
            x-=step;j--;
            direc=0;
        }
        p[k].x=x;
        p[k].y=y;
        p[k].direc=direc;
        if(k>0){
            count=k-1;
            while(count>=0
            &&(p[count].x!=p[k].x||p[count].y!=p[k].y))
            count--;
            if(count>=0){
                k=count;
                p[k].direc=direc;
                i=(p[k].y-len)/step;
                j=(p[k].x-len)/step;
            }
        }
        k++;
        break;
    case 3:
        if(j<N-1&&bg[i][j+1]==0){
            x+=step;j++;
            direc=2;
        }
        else if(i<M-1&&bg[i+1][j]==0){
            y+=step;i++;
            direc=3;
        }
        else if(j>0&&bg[i][j-1]==0){
            x-=step;j--;
            direc=0;
        }
        else {
            y-=step;i--;
            direc=1;
        }
        p[k].x=x;
        p[k].y=y;
        p[k].direc=direc;
        if(k>0){
            count=k-1;
            while(count>=0
            &&(p[count].x!=p[k].x||p[count].y!=p[k].y))
            count--;
            if(count>=0){
                k=count;
                p[k].direc=direc;
                i=(p[k].y-len)/step;
                j=(p[k].x-len)/step;
            }
        }
        k++;
        break;
    default :break;
    }

    }
    drawman(x0,y0,len);
    for(i=0;i<k-1;i++){
           
         drawman(p[i].x,p[i].y,len);
         delay(80000);
         drawman(p[i].x,p[i].y,len);
    }
    drawman(p[i].x,p[i].y,len);
    /* printf("%6d\n",k);
    for(i=0;i<k;i++){
         printf("%6d\n",p[k].y*N+p[k].x);
         if((k+1)%10==0)printf("\n");
    }*/
    getch();
    closegraph();
}/* 电脑控制结束 */

}/* main()结束 */

/* 绘制小人 */
void drawman(int x,int y,int len){
    int r=len/4;
    rect(x-r,y-len,x+r,y-len+2*r);
    line(x,y-len+2*r,x,y);
    line(x-len,y,x+len,y);
    line(x,y,x-len,y+len);
    line(x,y,x+len,y+len);
}
/* 绘制迷宫地图 */
void drawbg(int bg[][N],int a,int b,int size,int x,int y){
    int startx=x;
    int i,j;
    for(i=0;i<a;i++){
        for(j=0;j<b;j++){
            if(bg[i][j]==1)
                rect(x,y,x+size-1,y+size-1);
            x+=size;
        }
        x=startx;
        y+=size;
    }
    rectangle(0,0,size*b,size*a);
    line(0,0,size,0);line(0,0,0,size);
    line(size*b,size*(a-1),size*b,size*a);
    line(size*(b-1),size*a,size*b,size*a);
}
/* 绘制实心矩形 */
void rect(int x0,int y0,int x1,int y1){
    int i,j;
    for(i=x0;i<=x1;i++)
        line(i,y0,i,y1);
}

/* 随机生成代表迷宫地图的数组  */
void makebg(int a,int b){
    int i,j;
    int ran;
    int direc;
/* 初始化迷宫地图  */
    for(i=0;i<a;i++)
        for(j=0;j<b;j++)
            bg[i][j]=1;

/* 随机生成迷宫通路  */
    randomize();
    i=j=0;direc=2;
    while(1){

        bg[i][j]=0;
        if(i>=M-1&&j>=N-1)break;
        ran=(int)rand()*4;
        if(ran<1){
            if(direc!=1&&i<a-1){
                i++;
                direc=3;
            }
        }   
        else if(ran<2){
            if(direc!=2&&j>0){
                j--;
                direc=0;
            }
        }
        else if(ran<3){
            if(direc!=3&&i>0){
                i--;
                direc=1;
            }
        }
        else {
            if(direc!=0&&j<b-1){
                j++;
                direc=2;           
            }
        }
     }
/* 随机生成迷宫其余部分  */
    for(i=0;i<a;i++)
        for(j=0;j<b;j++)
            if(bg[i][j]==1){
                ran=(int)rand()*10;
                if(ran<3)bg[i][j]=0;
            }
}