jie65535/maze
1
0
Fork 0
mirror of https://github.com/jie65535/maze.git synced 2024-07-27 19:04:55 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update README and fixes

Browse Source
This commit is contained in:
杰 2024-04-06 17:35:11 +08:00
parent b23a123012
commit 16c763732a
4 changed files with 229 additions and 235 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
README.md
View File

@ -6,3 +6,8 @@ C++ 控制台 迷宫 使用了自动生成迷宫算法，实现迷宫基本玩
所以该代码只能在windows下编译 所以该代码只能在windows下编译
程序参数可以在代码头部设置，例如迷宫大小和输出区域大小等 程序参数可以在代码头部设置，例如迷宫大小和输出区域大小等
需要合适的字体才能正常显示
![游玩示例](play.git)

BIN
a.exe
View File

Binary file not shown.

459
code.cpp
View File

@ -9,10 +9,10 @@
using namespace std; using namespace std;
// 显示区域的大小 // 显示区域的大小
const size_t sWidth = 30, sHeight = 24; const size_t sWidth = 60, sHeight = 24;
// 迷宫的实际大小（必须是奇数！） // 迷宫的实际大小（必须是奇数！）
const size_t width = 9, height = 9; const size_t width = 33, height = 15;
const char wall = 1; const char wall = 1;
const char path = 0; const char path = 0;
const char target = 2; const char target = 2;
@ -34,10 +34,7 @@ vector<pair<pair<int, int>, int> > walls;
——2、如果对面的格子已经是通路了，那就从列表里移除这面墙 ——2、如果对面的格子已经是通路了，那就从列表里移除这面墙
*/ */
const int up = 0; enum Dir { Up, Down, Left, Right };
const int down = 1;
const int left = 2;
const int right = 3;
// 四周一步 // 四周一步
int xx[] = { 0, 0, -1, 1 }; int xx[] = { 0, 0, -1, 1 };
@ -56,288 +53,280 @@ const int margin = 3;
// 移动光标到xy位置 // 移动光标到xy位置
void gotoxy(int x, int y) void gotoxy(int x, int y)
{ {
COORD coord = { (short)x, (short)y }; COORD coord = { (short)x, (short)y };
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), coord); SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), coord);
} }
// 设置全地图为墙 // 设置全地图为墙
void setAllWall() void setAllWall()
{ {
for (int y = 0; y < height; ++y) for (int y = 0; y < height; ++y)
for (int x = 0; x < width; ++x) for (int x = 0; x < width; ++x)
map[y][x] = wall; map[y][x] = wall;
} }
// 是否越界 // 是否越界
bool isOutBounds(int x, int y) bool isOutBounds(int x, int y)
{ {
return (x<0 || x >= width return (x<0 || x >= width
|| y<0 || y >= height); || y<0 || y >= height);
} }
// 向四周探索 // 向四周探索
void explore(int x, int y) void explore(int x, int y)
{ {
// 遍历四个方向 // 遍历四个方向
for (int i = 0; i < 4; ++i) for (int i = 0; i < 4; ++i)
{ {
// 顺着一条路走 // 顺着一条路走
for (int x1 = x, y1 = y; for (int x1 = x, y1 = y;
!isOutBounds(x1, y1) !isOutBounds(x1, y1)
&& map[y1][x1] == path; && map[y1][x1] == path;
x1 += xx[i], y1 += yy[i]) x1 += xx[i], y1 += yy[i])
{ {
// 每走一个格子检查四周是否为通路 // 每走一个格子检查四周是否为通路
for (int fy = y1 - 1; fy <= y1 + 1; ++fy) for (int fy = y1 - 1; fy <= y1 + 1; ++fy)
for (int fx = x1 - 1; fx <= x1 + 1; ++fx) for (int fx = x1 - 1; fx <= x1 + 1; ++fx)
if (!isOutBounds(fx, fy) if (!isOutBounds(fx, fy)
&& fog[fy][fx]) && fog[fy][fx])
fog[fy][fx] = false; fog[fy][fx] = false;
} }
} }
} }
// 将坐标处的墙添加到待通墙中 // 将坐标处的墙添加到待通墙中
void pushAroundWall(int x, int y) void pushAroundWall(int x, int y)
{ {
// 遍历四个方向 // 遍历四个方向
for (int i = 0; i < 4; ++i) for (int i = 0; i < 4; ++i)
{ {
int tx = x + xx[i]; int tx = x + xx[i];
int ty = y + yy[i]; int ty = y + yy[i];
if (isOutBounds(tx, ty)) if (isOutBounds(tx, ty))
continue; continue;
int wx = x + x2[i]; int wx = x + x2[i];
int wy = y + y2[i]; int wy = y + y2[i];
if (isOutBounds(wx, wy)) if (isOutBounds(wx, wy))
continue; continue;
// 只要是墙就加入列表 // 只要是墙就加入列表
if (map[ty][tx] == wall) if (map[ty][tx] == wall)
walls.push_back(pair<pair<int, int>, int>(pair<int, int>( tx,ty ),i )); walls.push_back(pair<pair<int, int>, int>(pair<int, int>( tx,ty ),i ));
} }
} }
// 展示地图 // 展示地图
void showMap() void showMap()
{ {
int dx = sWidth / 2 - playerx; int dx = sWidth / 2 - playerx;
int dy = sHeight / 2 - playery; int dy = sHeight / 2 - playery;
// 移动光标到最开始的位置 // 移动光标到最开始的位置
gotoxy(1, 1); gotoxy(0, 0);
// 遍历整个地图 // 遍历整个地图
for (int sy = 0; sy < sHeight; ++sy) for (int sy = 0; sy < sHeight; ++sy)
{ {
for (int sx = 0; sx < sWidth; ++sx) for (int sx = 0; sx < sWidth; ++sx)
{ {
//putchar(map[y][x]?'@':' '); //putchar(map[y][x]?'@':' ');
int x = sx - dx; int x = sx - dx;
int y = sy - dy; int y = sy - dy;
const char *Symbol[5] = { "□", "▓", "▽", "☆", "◎" }; const char *Symbol[5] = { "□", "▓", "▽", "☆", "◎" };
if (isOutBounds(x, y)) if (isOutBounds(x, y))
{ {
printf("□"); printf("□");
continue; continue;
} }
if (x == playerx && y == playery) if (x == playerx && y == playery)
{ {
printf("◎"); printf("◎");
continue; continue;
} }
if (fog[y][x]) if (fog[y][x])
{ {
printf("▓"); printf("▓");
continue; continue;
} }
if (!walk[y][x]) if (!walk[y][x])
{ {
printf("▽"); printf("▽");
continue; continue;
} }
if (map[y][x] == path) if (map[y][x] == path)
{ {
printf("□"); printf("□");
continue; continue;
} }
if (map[y][x] == target) if (map[y][x] == target)
{ {
printf("☆"); printf("☆");
continue; continue;
} }
printf("▓"); printf("▓");
continue; continue;
// 到此截断，后面为单字符地图时用 // 到此截断，后面为单字符地图时用
int d = 0; // int d = 0;
for (int i = 0; i < 4; ++i) // for (int i = 0; i < 4; ++i)
{ // {
if (!isOutBounds(x + xx[i], y + yy[i]) && map[y + yy[i]][x + xx[i]] == wall) // if (!isOutBounds(x + xx[i], y + yy[i]) && map[y + yy[i]][x + xx[i]] == wall)
d |= 1 << i; // d |= 1 << i;
} // }
const int up = 1; // const int up = 1;
const int down = 2; // const int down = 2;
const int left = 4; // const int left = 4;
const int right = 8; // const int right = 8;
char ch = 0; // char ch = 0;
switch (d) // switch (d)
{ // {
case 0: // case 0:
ch = '&'; // ch = '&';
break; // break;
//case up: // //case up:
//case down: // //case down:
case up | down: // case up | down:
ch = '|'; // ch = '|';
break; // break;
//case left: // //case left:
//case right: // //case right:
case left | right: // case left | right:
ch = '-'; // ch = '-';
break; // break;
default: // default:
ch = '+'; // ch = '+';
} // }
putchar(ch); // putchar(ch);
} }
cout << endl; cout << endl;
} }
//gotoxy(sWidth/2+1, sHeight/2+1); //gotoxy(sWidth/2+1, sHeight/2+1);
//putchar('A'); //putchar('A');
}
/*
// 手动延时函数
void sleep(int n)
{
for (int i = 0; i < n*n*n*n; ++i);
}
*/
// 刷新地图
void refresh()
{
gotoxy(1, 1);
showMap();
} }
// 生成地图算法，参数为起始点坐标 // 生成地图算法，参数为起始点坐标
void generate(int cx, int cy) void generate(int cx, int cy)
{ {
// 首先将地图全部设置为墙 // 首先将地图全部设置为墙
setAllWall(); setAllWall();
// 填满迷雾，清空已经走过的路径 // 填满迷雾，清空已经走过的路径
for (int i = 0; i < width*height; ++i) for (int i = 0; i < width*height; ++i)
*((bool*)fog + i) = *((bool*)walk + i) = true; *((bool*)fog + i) = *((bool*)walk + i) = true;
//设置玩家的坐标 //设置玩家的坐标
playerx = cx; playerx = cx;
playery = cy; playery = cy;
// 从起点开始，将四周的墙壁添加到待凿列表中 // 从起点开始，将四周的墙壁添加到待凿列表中
pushAroundWall(cx, cy); pushAroundWall(cx, cy);
// 把这个点变成路 // 把这个点变成路
map[cy][cx] = path; map[cy][cx] = path;
// 只要还有待凿的墙，就一直循环 // 只要还有待凿的墙，就一直循环
while (!walls.empty()) while (!walls.empty())
{ {
// 随机找个待凿的墙 // 随机找个待凿的墙
int index = rand() % walls.size(); int index = rand() % walls.size();
int wx = walls[index].first.first; int wx = walls[index].first.first;
int wy = walls[index].first.second; int wy = walls[index].first.second;
int d = walls[index].second; int d = walls[index].second;
// 如果是墙，打穿，将下一个点四周的墙壁加入待凿列表 // 如果是墙，打穿，将下一个点四周的墙壁加入待凿列表
if (map[wy + yy[d]][wx + xx[d]] == wall) if (map[wy + yy[d]][wx + xx[d]] == wall)
{ {
map[wy][wx] = path; map[wy][wx] = path;
map[wy + yy[d]][wx + xx[d]] = path; map[wy + yy[d]][wx + xx[d]] = path;
pushAroundWall(wx + xx[d], wy + yy[d]); pushAroundWall(wx + xx[d], wy + yy[d]);
//sleep(70); }
//refresh(); // 打穿后，将该墙移除待凿列表
} walls.erase(walls.begin() + index);
// 打穿后，将该墙移除待凿列表 }
walls.erase(walls.begin() + index);
} map[height-2][width-2] = target;
map[height-2][width-2] = target;
// 展开迷雾 // 展开迷雾
explore(playerx, playery); explore(playerx, playery);
} }
// 玩家移动，参数是移动的方向 // 玩家移动，参数是移动的方向
void playerMove(int dir) bool playerMove(Dir dir)
{ {
if (0 > dir || dir >= 4) if (0 > dir || dir >= 4)
return; return false;
int tx = playerx + xx[dir]; int tx = playerx + xx[dir];
int ty = playery + yy[dir]; int ty = playery + yy[dir];
if (isOutBounds(tx, ty)) if (isOutBounds(tx, ty))
return; return false;
if (map[ty][tx] == wall) if (map[ty][tx] == wall)
return; return false;
if (map[ty][tx] == target) if (map[ty][tx] == target)
{ {
system("cls"); system("cls");
cout << "游戏胜利！" << endl; cout << "游戏胜利！" << endl;
system("pause"); system("pause");
exit(0); return true;
} }
// 只有是路的时候才可以移动 // 只有是路的时候才可以移动
if (map[ty][tx] == path) { if (map[ty][tx] == path) {
playerx = tx, playery = ty; playerx = tx, playery = ty;
walk[ty][tx] = false; walk[ty][tx] = false;
} }
// 移动完后再次探索迷雾 // 移动完后再次探索迷雾
explore(playerx, playery); explore(playerx, playery);
return false;
} }
// 每一帧执行更新 // 每一帧执行更新
void updata() bool updata()
{ {
char ch = getch(); char ch = getch();
switch (ch) bool win = false;
{ switch (ch)
case 'w': {
playerMove(up); case 'w':
break; win = playerMove(Dir::Up);
case 's': break;
playerMove(down); case 's':
break; win = playerMove(Dir::Down);
case 'a': break;
playerMove(2); case 'a':
break; win = playerMove(Dir::Left);
case 'd': break;
playerMove(3); case 'd':
break; win = playerMove(Dir::Right);
} break;
case 'q':
exit(0);
break;
case 'r':
return false;
break;
}
return !win;
} }
int main() int main()
{ {
// 设置种子 // 设置种子
srand((unsigned int)time(0)); srand((unsigned int)time(0));
do {
// 生成地图 printf("WSAD移动，Q退出，R重开");
generate(1, 1); system("pause");
// 游戏循环 while (true) {
while (1) // 生成地图
{ generate(1, 1);
// 输出地图
showMap(); // 游戏循环
// 等待输入，更新 do {
updata(); // 输出地图
} showMap();
} while (updata());
} while (getch() != 0); }
return 0; return 0;
} }

BIN
play.gif Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 1.2 MiB