资 源 简 介
资源描述#include
#define M 6
#define N 8
int move[4][2]=0,1},{1,0},{0,-1},{-1,0;//方向坐标值
int maze[M+2][N+2]={{1,1,1,1,1,1,1,1,1,1},{1,0,0,1,1,0,1,0,1,1},{1,1,0,0,1,1,0,0,0,1},
{1,0,0,0,0,0,0,1,1,1},{1,1,1,0,1,1,0,0,0,1},{1,0,0,0,0,0,1,0,1,1},
{1,1,0,1,0,0,0,0,0,1},{1,1,1,1,1,1,1,1,1,1}};
int mark[M+2][N+2]={{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0}};
//寻找迷宫路径
int PeekPath(int x, int y)
{
int i;//行走方向
int row, col;//下一步的行坐标值、列坐标值
if(x==M && y==N)//到达终点则返回1 结束
return(1);
for(i=0; i<4; i++)
{
row = x+move[i][0];
col = y+move[i][1];
if(maze[row][col]==0 && mark[row][col]==0)//所在位置可走且未标记则标记该位置并判断是否通向终
