/*初始化迷宫*/ void inimaze (int maze[ ][N2]) num for(i=l; i<=M; i++) /*根据M和N的值产生迷宫*/ num=(800*(i+j)+1500)&327; if (num<150 &&(i!=M j!=N)) maze lilli]=l else [i][j printf(“%3d”,maze[i][j);/显示迷宫*/ printf(“hn”) pr for(i=0,j=0;i<=M+1;i++)/设置迷宫的边界值* mazelillj]=l for(i=0,j=N+1;i<=M+1;i+) maze[i][j]= (i=0,j=0;j<=N+1;j++) maze li][j]=1: for(i=M+1,j=0;j=N+1;j++) maze[i][j]= /米 Inmage*/ /*初始化方向位移数组*/ void inimove(struct moved move) move[0].dx=0;move[0].dy=1;/*依次为E,SE,S,SW,W,NW,N,NE* move [1]. dx=1: move [1]dy move [2]. dx=1: move [2]. dy=0 move [4].dx=0; move [4] dy=-1 move [5]. dx=-1; move [5]. dy=-1 move [6]. dx=-1: move [6] dy=0 move [7]. dx=-1: move[7. dy=l 1/*inimove*/ /*初始化栈*/ oid inistack(sgstktp *s) [s->top=-1/*初始化迷宫*/ void inimaze(int maze[ ][N2]) { int i,j,num; for(i=1;i<=M;i++) /*根据 M 和 N 的值产生迷宫*/ { for(j=1;j<=N;j++) { num=(800*(i+j)+1500) &327; if (num<150 &&(i!=M ||j!=N)) maze[i][j]=1; else maze[i][j]=0; printf(“%3d”,maze[i][j]); /*显示迷宫*/ } printf(“\n”); } printf(“\n”); for(i=0,j=0;i<=M+1;i++) /*设置迷宫的边界值*/ maze[i][j]=1; for(i=0,j=N+1;i<=M+1;i++) maze[i][j]=1; for (i=0,j=0;j<=N+1;j++) maze[i][j]=1; for(i=M+1,j=0;j<=N+1;j++) maze[i][j]=1; } /*inimaze*/ /*初始化方向位移数组*/ void inimove(struct moved move[]) { move[0].dx=0;move[0].dy=1; /*依次为 E,SE,S,SW,W,NW,N,NE*/ move[1].dx=1;move[1].dy=1; move[2].dx=1;move[2].dy=0; move[3].dx=1;move[3].dy=-1; move[4].dx=0;move[4].dy=-1; move[5].dx=-1;move[5].dy=-1; move[6].dx=-1;move[6].dy=0; move[7].dx=-1;move[7].dy=1; }/*inimove*/ /*初始化栈*/ void inistack(sqstktp *s) {s->top=-1;