migong.cpp

简单的迷宫算法

// migong.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
//using namespace std;
//int Maxsize=8;
#define Maxsize 8
int H[4]={0,1,0,-1};
int V[4]={-1,0,1,0};
char Maze[Maxsize][Maxsize]={{'x','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','x'}};
void FindPath(int x,int y){
	if(x==Maxsize||y==Maxsize){
		for(int i=0;i<Maxsize;i++)
			for(int j=0;j<Maxsize;j++)
				printf("%c%c",Maze[i][j],j<Maxsize-1?' ':'\n');
	}else for(int k=0;k<4;k++)
		if(x>=0&&y>=0&&y<Maxsize&&x<Maxsize&&'o'==Maze[x][y]){
			Maze[x][y]=' ';
			FindPath(x+V[k],y+H[k]);
			Maze[x][y]='o';
		}

}
int _tmain(int argc, _TCHAR* argv[])
{
	FindPath(1,0);
	return 0;
}