回溯法解决走迷宫问题

给定一个二维数组maze[m+2][p+2]表示迷宫，1表示墙壁，0表示通路，数组第0行、第m+1列、第0列、第p+1列是迷墙的围墙。路线可以有8个方向，定义一个表包括这8个方向。

struct offset          //方向结构体，a代表x的偏移量，b代表y的偏移量
{
	int a, b;
	char *dir;
};

const int m = 12, p = 15;
int Maze[m + 2][p + 2] = { {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
						   {0,0,1,0,0,0,1,1,0,0,0,1,1,1,1,1,1},
						   {1,1,0,0,0,1,1,0,1,1,1,0,0,1,1,1,1},
						   {1,0,1,1,0,0,0,0,1,1,1,1,0,0,1,1,1},
						   {1,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1},
						   {1,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1},
						   {1,0,0,1,1,0,1,1,1,0,1,0,0,1,0,1,1},
						   {1,0,0,1,1,0,1,1,1,0,1,0,0,1,0,1,1},
						   {1,0,1,1,1,1,0,0,1,1,1,1,1,1,1,1,1},
						   {1,0,0,1,1,0,1,1,0,1,1,1,1,1,0,1,1},
						   {1,1,1,0,0,0,1,1,0,1,1,0,0,0,0,0,1},
						   {1,0,0,1,1,1,1,1,0,0,0,1,1,1,1,0,1},
						   {1,0,1,0,0,1,1,1,1,1,0,1,1,1,1,0,0},
						   {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1} };
int Mark[m + 2][p + 2] = { 0 };
offset Move[8] = { { -1,0,"N" },{ -1, 1,"NE" },{ 0, 1, "E" },{ 1, 1,"SE" },{ 1,0,"S" },{ 1,-1,"SW" },{ 0,-1,"W" },{ -1,-1,"NW" } };

int SeekPath(int x, int y) {
	//从迷宫的某一位置[i][j]开始，寻找通向出口[m][p]的一条路径，如果能找到，就返回1
	int i, g, h;
	char *d;
	if (x == m && y == p) {    //找到出口
		return 1;
	}
	for (i = 0; i < 8; ++i) {      //8个方向试探
		g = x + Move[i].a;
		h = y + Move[i].b;
		d = Move[i].dir;
		if (Maze[g][h] == 0 && Mark[g][h] == 0) {     //下一地点是合理地点，且未访问
			Mark[g][h] = 1;
			if (SeekPath(g, h)) {
				cout << "(" << g << ", " << h << "), " << "Direction: " << d << endl;
				return 1;
			}
		}
		//回溯，换一个方向继续
	}
	if (x == 1 && y == 1) {
		cout << "no path out!" << endl;
	}
	return 0;
}

int main()
{
	int i, j;
	Mark[1][1] = 1;
	if (SeekPath(1, 1)) {
		cout << "(" << 1 << " , " << 1 << "), " << "Direction: " << "E" << endl;
	}
	
	system("pause");
    return 0;
}