C++迷宫寻址

最新推荐文章于 2024-07-16 19:52:25 发布

马斯塔

最新推荐文章于 2024-07-16 19:52:25 发布

阅读量99

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_43036419/article/details/109687237

版权

#include<iostream>
using namespace std;
#define maxX 6
#define maxY 11

typedef struct offset {
	char dir;
	int x, y;
}locate;

struct offset action[4] = { {'N',0,-1},{'S',0,1},{'W',1,0},{'E',-1,0} };

int SeekPath(int map[][maxX], int mark[][maxX],int x,int y,int m,int p)
{
	int tx, ty;
	if (x == m && y == p)return 1;
	for (int i = 0;i < 4;i++)
	{
		tx = action[i].x + x;
		ty = action[i].y + y;
		if (!mark[ty][tx] && !map[ty][tx])
		{
			mark[ty ][ tx ] = 1;
			if (SeekPath(map, mark, tx, ty, m, p))
			{
				cout << "move to" << action[i].dir << endl;
				return 1;
			}
		}
	}
	if (x == 1 && y == 1)cout << "no path" << endl;
	return 0;
}

int main()
{
	int map[maxY][maxX] = { 1,1,1,1,1,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,0,0,1,1,1,0,1,1,1,1,1,0,0,0,0,1,1,1,1,1,0,1,1,0,0,0,0,1,1,0,1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1 };
	int mark[maxY][maxX];
	for (int i = 0;i < maxY + 1;i++)
		for (int j = 0;j < maxX + 1;j++)
			mark[i][j] = 0;
	for (int i = 0;i < maxY;i++)
		mark[i][0] = mark[i][maxX-1] = 1;
	for (int i = 0;i < maxX;i++)
		mark[0][i] = mark[maxY-1][i] = 1;

	SeekPath(map, mark, 1, 1, 4, 9);
	getchar();
}