C语言蛮力法解决迷宫问题

//迷宫问题解法2

#include <stdio.h>
#define MAXQ 100								//队列大小
#define MAxN 10									//最大迷宫大小
//问题表示
int n=8;
																		
char Maze[MAxN][MAxN]={							//迷宫大小
		{'O','x','x','x','x','x','x','x'},
		{'O','O','O','O','O','x','x','x'},
		{'x','O','x','x','O','O','O','x'},
		{'x','O','x','x','O','x','x','O'},
		{'x','O','x','x','x','x','x','x'},
		{'x','O','x','x','O','O','O','x'},
		{'x','O','O','O','O','x','O','O'},
		{'x','x','x','x','x','x','x','O&