VS2022 C++ EasyX EGE 吃豆人升级版

最新推荐文章于 2024-09-16 17:46:36 发布
最新推荐文章于 2024-09-16 17:46:36 发布
阅读量300 收藏 2
点赞数 8
分类专栏： VS2022 EGE 游戏创作 文章标签： c++ 算法 开发语言
版权声明：本文为博主原创文章，遵循 CC 4.0 BY 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_72166565/article/details/141190635
版权

我是可爱的C++小盆友（不要脸了），嘻嘻，等了这么久，吃豆人终于升级啦！

更新日志：

1.修复奇奇怪怪的bug

2.把敌人AI增强了一（hen）点（duo）

3.加入了奖励豆，吃完有特殊的东西

        1）万物复苏 玩家生命值+3

        2）极致严寒 敌人移动速度降低

        3）无限牢笼 送一个敌人到地图四个角落种一个

本小盆友很想破1000粉丝，求大家四连（点赞，关注，收藏，转发）

对了，提醒一句，如果要改我的代码，千万不要加using namespace std这一行，整个程序会炸，不信自己试，逝世了我可不负责昂

好啦，下面是大家最喜欢的代码环节！

#include<bits/stdc++.h>
#include<queue>
#include<conio.h>
#pragma comment(lib,"winmm.lib")
#define _CRT_SECURE_NO_WARNINGS
#define WIDTH				15*25
#define HEIGHT				22*25
#define GRID				25
#define ROW					20
#define COL					15
using std::cout;
using std::endl;
int b = 255;
int m = 0, n = 0;
int speed = 400;
int life = 5;
int score = 0;
bool willGo = true;
bool canGo = true;
bool isChange = true;
long long min = 99999999, timesa = 1, v[ROW][COL];
DWORD t1 = 0, t2 = 0;
DWORD t3 = 0, t4 = 0;
DWORD t5 = 0, t6 = 0;//奖励函数特用
IMAGE img[8];
IMAGE Enemy[4];
IMAGE bean, bean2;
COLORREF color = RGB(0, 0, 0);
enum DIR {
	NONE,
	UP,
	DOWN,
	LEFT,
	RIGHT,
	WAITING
};
enum TOOLS {
	WALL,
	PLAYER,
	SPACE,
	ENEMY,
	BEAN,
	ENEMYBEAN,
	ENEMYSBEAN,
	SBEAN
};
struct Point {
	int x, y;
};
struct Player {
	int x, y;
	bool flag;
	DIR dir;
}player;
struct ENEmy {
	int x, y;
	int flag;
	DIR dir;
}enemy[4];
int map[ROW][COL] = {
	WALL,WALL,WALL,WALL,WALL,WALL,WALL,BEAN,WALL,WALL,WALL,WALL,WALL,WALL,WALL,
	WALL,BEAN,BEAN,BEAN,BEAN,WALL,BEAN,BEAN,BEAN,WALL,BEAN,BEAN,BEAN,BEAN,WALL,
	WALL,BEAN,WALL,WALL,BEAN,WALL,BEAN,WALL,BEAN,WALL,BEAN,WALL,WALL,BEAN,WALL,
	BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,
	WALL,WALL,BEAN,WALL,WALL,WALL,WALL,BEAN,WALL,WALL,WALL,WALL,BEAN,WALL,WALL,
	WALL,WALL,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,WALL,WALL,
	WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,
	WALL,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,WALL,
	WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,
	WALL,BEAN,WALL,WALL,BEAN,WALL,BEAN,BEAN,BEAN,WALL,BEAN,WALL,WALL,BEAN,WALL,
	WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,
	WALL,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,WALL,
	WALL,WALL,BEAN,WALL,WALL,BEAN,WALL,BEAN,WALL,BEAN,WALL,WALL,BEAN,WALL,WALL,
	WALL,WALL,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,WALL,WALL,
	WALL,BEAN,BEAN,BEAN,BEAN,WALL,WALL,BEAN,WALL,WALL,BEAN,BEAN,BEAN,BEAN,WALL,
	WALL,WALL,BEAN,WALL,WALL,WALL,WALL,BEAN,WALL,WALL,WALL,WALL,BEAN,WALL,WALL,
	BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,BEAN,
	WALL,BEAN,WALL,WALL,BEAN,WALL,BEAN,WALL,BEAN,WALL,BEAN,WALL,WALL,BEAN,WALL,
	WALL,BEAN,BEAN,BEAN,BEAN,WALL,BEAN,BEAN,BEAN,WALL,BEAN,BEAN,BEAN,BEAN,WALL,
	WALL,WALL,WALL,WALL,WALL,WALL,WALL,BEAN,WALL,WALL,WALL,WALL,WALL,WALL,WALL,
};
void drawText() {
	if (b <= 1) {
		isChange = false;
	}
	else if (b >= 255 - 8) {
		isChange = true;
	}
	char ch[1000];
	int spaceH;
	settextcolor(RGB(60, 10, b));
	settextstyle(25, 0, "华文行楷");
	sprintf_s(ch, "生命: %d          得分: %d", life, score);
	spaceH = (getwidth() - textwidth(ch)) / 2;
	outtextxy(spaceH, 20 * 25, ch);
	sprintf_s(ch, "x:%d   y:%d", player.x, player.y);
	spaceH = (getwidth() - textwidth(ch)) / 2;
	outtextxy(spaceH, 21 * 25, ch);
	if (isChange) {
		b -= 7;
	}
	else {
		b += 7;
	}
}
void initMap() {
	loadimage(&Enemy[0], "01.png", GRID, GRID);
	loadimage(&Enemy[1], "02.png", GRID, GRID);
	loadimage(&Enemy[2], "03.png", GRID, GRID);
	loadimage(&Enemy[3], "04.png", GRID, GRID);

	loadimage(&img[0], "UP_CLOSE.jpg", 24, 24);
	loadimage(&img[1], "UP_OPEN.jpg", 24, 24);
	loadimage(&img[2], "DOWN_CLOSE.jpg", 24, 24);
	loadimage(&img[3], "DOWN_OPEN.jpg", 24, 24);
	loadimage(&img[4], "LEFT_CLOSE.jpg", 24, 24);
	loadimage(&img[5], "LEFT_OPEN.jpg", 24, 24);
	loadimage(&img[6], "RIGHT_CLOSE.jpg", 24, 24);
	loadimage(&img[7], "RIGHT_OPEN.jpg", 24, 24);

	loadimage(&bean, "bean.png", 15, 15);
	loadimage(&bean2, "sbean.png", 15, 15);

	map[m][n] = PLAYER;
	player.flag = true;
	player.x = m;
	player.y = n;
	srand((unsigned int)time(NULL));
	for (int i = 0; i < 4; i++) {
		int a = rand() % (ROW - 2) + 1;
		int b = rand() % (COL - 2) + 1;
		while (map[a][b] == WALL || map[a][b] == PLAYER) {
			a = rand() % (ROW - 2) + 1;
			b = rand() % (COL - 2) + 1;
		}
		enemy[i].x = a;
		enemy[i].y = b;
		map[a][b] = ENEMYSBEAN;
	}
}
void drawMap() {
	setbkmode(TRANSPARENT);
	setbkcolor(RGB(83, 55, 213));
	cleardevice();
	for (int i = 0; i < ROW; i++) {
		for (int j = 0; j < COL; j++) {
			switch (map[i][j]) {
			case SPACE:
				color = RGB(81, 55, 213);
				setlinecolor(color);
				setfillcolor(color);
				fillrectangle(j * GRID, i * GRID, j * GRID + GRID, i * GRID + GRID);
				break;
			case WALL:
				color = RGB(150, 0, 255);
				setlinecolor(color);
				setfillcolor(color);
				setlinecolor(WHITE);
				setlinestyle(PS_SOLID, 1);
				fillroundrect(j * GRID, i * GRID, j * GRID + GRID, i * GRID + GRID, 6, 6);
				break;
			case PLAYER:
				switch (player.flag) {
				case true:
					switch (player.dir) {
					case UP:
						putimage(j * GRID, i * GRID, &img[1]);
						break;
					case DOWN:
						putimage(j * GRID, i * GRID, &img[3]);
						break;
					case LEFT:
						putimage(j * GRID, i * GRID, &img[5]);
						break;
					case RIGHT:
						putimage(j * GRID, i * GRID, &img[7]);
						break;
					}
					break;
				case false:
					switch (player.dir) {
					case UP:
						putimage(j * GRID, i * GRID, &img[0]);
						break;
					case DOWN:
						putimage(j * GRID, i * GRID, &img[2]);
						break;
					case LEFT:
						putimage(j * GRID, i * GRID, &img[4]);
						break;
					case RIGHT:
						putimage(j * GRID, i * GRID, &img[6]);
						break;
					}
					break;
				}
				break;
			case ENEMY:
				for (int k = 0; k < 4; k++) {
					if (enemy[k].x == i && enemy[k].y == j) {
						putimage(j * GRID, i * GRID, &Enemy[k]);
					}
				}
				break;
			case BEAN:
				putimage(j * GRID + 5, i * GRID + 5, &bean);
				break;
			case SBEAN:
				putimage(j * GRID + 5, i * GRID + 5, &bean2);
				break;
			case ENEMYSBEAN:
				for (int k = 0; k < 4; k++) {
					if (enemy[k].x == i && enemy[k].y == j) {
						putimage(j * GRID, i * GRID, &Enemy[k]);
					}
				}
				break;
			case ENEMYBEAN:
				for (int k = 0; k < 4; k++) {
					if (enemy[k].x == i && enemy[k].y == j) {
						putimage(j * GRID, i * GRID, &Enemy[k]);
					}
				}
				break;
			}
		}
	}
	for (int i = 0; i < ROW; i++) {
		for (int j = 0; j < COL; j++) {
			switch (map[i][j]) {
			case WALL:
				color = RGB(150, 0, 255);
				setlinecolor(color);
				setfillcolor(color);
				setlinecolor(WHITE);
				setlinestyle(PS_SOLID, 1);
				fillroundrect(j * GRID, i * GRID, j * GRID + GRID, i * GRID + GRID, 6, 6);
				break;
			}
		}
	}
	drawText();
}
void drawText2(char ch[100]) {
	mciSendString("pause 1.mp3", 0, 0, 0);
	//setbkcolor(BLACK);
	//cleardevice();
	//setfillcolor(BLACK);
	//fillrectangle(0, 0, WIDTH, HEIGHT);
	settextcolor(RED);
	settextstyle(45, 0, "华文行楷");
	int spaceH = (getwidth() - textwidth(ch)) / 2;
	int spaceV = (getheight() - textheight(ch)) / 2;
	outtextxy(spaceH, spaceV, ch);
	FlushBatchDraw();
	Sleep(1250);
	drawMap();
	mciSendString("play 1.mp3 repeat", 0, 0, 0);
}
void movePlayer() {
	int sp;
	char c;
	char ch1[22] = "万   物   复   苏";
	char ch2[22] = "极   致   严   寒";
	char ch3[22] = "无   限   牢   笼";
	Player next = player;
	switch (player.dir) {
	case UP:
		next.x--;
		break;
	case DOWN:
		next.x++;
		break;
	case LEFT:
		next.y--;
		break;
	case RIGHT:
		next.y++;
		break;
	}
	if (player.x == 16 && player.y == 0 && canGo) {
		map[player.x][player.y] = SPACE;
		player.x = 16;
		player.y = COL - 1;
		player.dir = LEFT;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = false;
	}
	else if (player.x == 16 && player.y == COL - 1 && canGo) {
		map[player.x][player.y] = SPACE;
		player.x = 16;
		player.y = 0;
		player.dir = RIGHT;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = false;
	}

	if (player.x == 3 && player.y == 0 && canGo) {
		map[player.x][player.y] = SPACE;
		player.x = 3;
		player.y = COL - 1;
		player.dir = LEFT;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = false;
	}
	else if (player.x == 3 && player.y == COL - 1 && canGo) {
		map[player.x][player.y] = SPACE;
		player.x = 3;
		player.y = 0;
		player.dir = RIGHT;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = false;
	}

	if (player.x == 0 && player.y == 7 && canGo) {
		map[player.x][player.y] = SPACE;
		player.x = ROW - 1;
		player.y = 7;
		player.dir = UP;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = false;
	}
	else if (player.x == ROW - 1 && player.y == 7 && canGo) {
		map[player.x][player.y] = SPACE;
		player.x = 0;
		player.y = 7;
		player.dir = DOWN;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = false;
	}
	/*
	Player next2 = player;
	switch (map[next2.x][next2.y]) {
	case WALL:
		break;
	case SPACE:
		map[player.x][player.y] = SPACE;
		player = next2;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = true;
		break;
	case ENEMY:
	case ENEMYBEAN:
	case ENEMYSBEAN:
		for (int i = 0; i < 4; i++) {
			if (next2.x == enemy[i].x && next2.y == enemy[i].y) {
				life--;
				if (life == 0) {
					mciSendString("close 1.mp3", 0, 0, 0);
					c = getchar();
					exit(0);
				}
				else {
					map[player.x][player.y] = SPACE;
					player.x = m;
					player.y = n;
					break;
				}
			}
		}
		break;
	case BEAN:
		score++;
		map[player.x][player.y] = SPACE;
		player = next2;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = true;
		break;
	case SBEAN:
		score += 10;
		map[player.x][player.y] = SPACE;
		player = next2;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = true;
		srand((unsigned int)time(NULL));
		sp = rand() % 3 + 1;
		switch (sp) {
		case 1:
			break;
		case 2:
			break;
		case 3:
			break;
		}
		break;
	}
	*/
	switch (map[next.x][next.y]) {
	case WALL:
		break;
	case SPACE:
		map[player.x][player.y] = SPACE;
		player = next;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = true;
		break;
	case ENEMY:
	case ENEMYBEAN:
	case ENEMYSBEAN:
		for (int i = 0; i < 4; i++) {
			if (next.x == enemy[i].x && next.y == enemy[i].y) {
				life--;
				if (life == 0) {
					mciSendString("close 1.mp3", 0, 0, 0);
					c = getchar();
					exit(0);
				}
				else {
					map[player.x][player.y] = SPACE;
					player.x = m;
					player.y = n;
					break;
				}
			}
		}
		break;
	case BEAN:
		score++;
		map[player.x][player.y] = SPACE;
		player = next;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = true;
		break;
	case SBEAN:
		score += 10;
		map[player.x][player.y] = SPACE;
		player = next;
		map[player.x][player.y] = PLAYER;
		player.flag = !player.flag;
		canGo = true;
		srand((unsigned int)time(NULL));
		sp = rand() % 4 + 1;
		if (sp == 1) {
			drawText2(ch1);
			life += 3;
		}
		else if (sp == 2) {
			drawText2(ch2);
			speed += 200;
		}
		else {
			drawText2(ch3);
			for (int i = 0; i < 4; i++) {
				if (enemy[i].x != 0 && enemy[i].y != 0 && map[0][0] != ENEMY) {
					map[enemy[i].x][enemy[i].y] = SBEAN;
					enemy[i].x = 0;
					enemy[i].y = 0;
					map[enemy[i].x][enemy[i].y] = ENEMY;
					break;
				}
				else if (enemy[i].x != 0 && enemy[i].y != 0 && map[0][COL - 1] != ENEMY) {
					map[enemy[i].x][enemy[i].y] = SBEAN;
					enemy[i].x = 0;
					enemy[i].y = COL - 1;
					map[enemy[i].x][enemy[i].y] = ENEMY;
					break;
				}
				else if (enemy[i].x != 0 && enemy[i].y != 0 && map[ROW - 1][0] != ENEMY) {
					map[enemy[i].x][enemy[i].y] = SBEAN;
					enemy[i].x = ROW - 1;
					enemy[i].y = 0;
					map[enemy[i].x][enemy[i].y] = ENEMY;
					break;
				}
				else if (enemy[i].x != 0 && enemy[i].y != 0 && map[ROW - 1][COL - 1] != ENEMY) {
					map[enemy[i].x][enemy[i].y] = SBEAN;
					enemy[i].x = ROW - 1;
					enemy[i].y = COL - 1;
					map[enemy[i].x][enemy[i].y] = ENEMY;
					break;
				}
			}
		}
		break;
	}
}
void keyDown() {
	if (_kbhit()) {
		canGo = true;
		switch (_getch()) {
		case 72:
			player.dir = UP;
			break;
		case 80:
			player.dir = DOWN;
			break;
		case 75:
			player.dir = LEFT;
			break;
		case 77:
			player.dir = RIGHT;
			break;
		}
	}
}
void moveEnemy() {
	char c;
	for (int i = 0; i < 4; i++) {
		ENEmy next = enemy[i];
		switch (enemy[i].dir) {
		case UP:
			next.x--;
			break;
		case DOWN:
			next.x++;
			break;
		case LEFT:
			next.y--;
			break;
		case RIGHT:
			next.y++;
			break;
		}
		if (enemy[i].x == 16 && enemy[i].y == 0 && canGo) {
			map[enemy[i].x][enemy[i].y] = SPACE;
			enemy[i].x = 16;
			enemy[i].y = COL - 1;
			enemy[i].dir = LEFT;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			canGo = false;
		}
		else if (enemy[i].x == 16 && enemy[i].y == COL - 1 && canGo) {
			map[enemy[i].x][enemy[i].y] = SPACE;
			enemy[i].x = 16;
			enemy[i].y = 0;
			enemy[i].dir = RIGHT;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			canGo = false;
		}

		if (enemy[i].x == 3 && enemy[i].y == 0 && canGo) {
			map[enemy[i].x][enemy[i].y] = SPACE;
			enemy[i].x = 3;
			enemy[i].y = COL - 1;
			enemy[i].dir = LEFT;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			canGo = false;
		}
		else if (enemy[i].x == 3 && enemy[i].y == COL - 1 && canGo) {
			map[enemy[i].x][enemy[i].y] = SPACE;
			enemy[i].x = 3;
			enemy[i].y = 0;
			enemy[i].dir = RIGHT;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			canGo = false;
		}

		if (enemy[i].x == 0 && enemy[i].y == 7 && canGo) {
			map[enemy[i].x][enemy[i].y] = SPACE;
			enemy[i].x = ROW - 1;
			enemy[i].y = 7;
			enemy[i].dir = UP;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			canGo = false;
		}
		else if (enemy[i].x == ROW - 1 && enemy[i].y == 7 && canGo) {
			map[enemy[i].x][enemy[i].y] = SPACE;
			enemy[i].x = 0;
			enemy[i].y = 7;
			enemy[i].dir = DOWN;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			canGo = false;
		}
		/*
		ENEmy next2 = enemy[i];
		switch (map[next2.x][next2.y]) {
		case WALL:
			break;
		case SPACE:
			if (map[enemy[i].x][enemy[i].y] == ENEMYBEAN) {
				map[enemy[i].x][enemy[i].y] = BEAN;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYSBEAN) {
				map[enemy[i].x][enemy[i].y] = SBEAN;
			}
			else {
				map[enemy[i].x][enemy[i].y] = SPACE;
			}
			enemy[i] = next2;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			break;
		case ENEMY:
		case ENEMYBEAN:
		case ENEMYSBEAN:
			break;
		case PLAYER:
			for (int i = 0; i < 4; i++) {
				if (next2.x == enemy[i].x && next2.y == enemy[i].y) {
					for (int i = 0; i < ROW; i++) {
						for (int j = 0; j < COL; j++) {
							printf("%d ", map[i][j]);
						}
						printf("\n");
					}
					printf("\n");
					life--;
					if (life == 0) {
						mciSendString("close 1.mp3", 0, 0, 0);
						c = getchar();
						exit(0);
					}
					else {
						map[player.x][player.y] = SPACE;
						player.x = m;
						player.y = n;
						break;
					}
				}
			}
			break;
		case BEAN:
			if (map[enemy[i].x][enemy[i].y] == ENEMY) {
				map[enemy[i].x][enemy[i].y] = SPACE;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYBEAN) {
				map[enemy[i].x][enemy[i].y] = BEAN;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYSBEAN) {
				map[enemy[i].x][enemy[i].y] = SBEAN;
			}
			enemy[i] = next2;
			map[enemy[i].x][enemy[i].y] = ENEMYBEAN;
			break;
		case SBEAN:
			if (map[enemy[i].x][enemy[i].y] == ENEMY) {
				map[enemy[i].x][enemy[i].y] = SPACE;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYBEAN) {
				map[enemy[i].x][enemy[i].y] = BEAN;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYSBEAN) {
				map[enemy[i].x][enemy[i].y] = SBEAN;
			}
			enemy[i] = next2;
			map[enemy[i].x][enemy[i].y] = ENEMYSBEAN;
			break;
		}
		*/
		switch (map[next.x][next.y]) {
		case WALL:
			break;
		case SPACE:
			if (map[enemy[i].x][enemy[i].y] == ENEMYBEAN) {
				map[enemy[i].x][enemy[i].y] = BEAN;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYSBEAN) {
				map[enemy[i].x][enemy[i].y] = SBEAN;
			}
			else {
				map[enemy[i].x][enemy[i].y] = SPACE;
			}
			enemy[i] = next;
			map[enemy[i].x][enemy[i].y] = ENEMY;
			break;
		case ENEMY:
		case ENEMYBEAN:
		case ENEMYSBEAN:
			break;
		case PLAYER:
			for (int i = 0; i < 4; i++) {
				if (next.x == player.x && next.y == player.y) {
					life--;
					if (life == 0) {
						mciSendString("close 1.mp3", 0, 0, 0);
						c = getchar();
						exit(0);
					}
					else {
						map[player.x][player.y] = SPACE;
						player.x = m;
						player.y = n;
						break;
					}
				}
			}
			break;
		case BEAN:
			if (map[enemy[i].x][enemy[i].y] == ENEMY) {
				map[enemy[i].x][enemy[i].y] = SPACE;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYBEAN) {
				map[enemy[i].x][enemy[i].y] = BEAN;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYSBEAN) {
				map[enemy[i].x][enemy[i].y] = SBEAN;
			}
			enemy[i] = next;
			map[enemy[i].x][enemy[i].y] = ENEMYBEAN;
			break;
		case SBEAN:
			if (map[enemy[i].x][enemy[i].y] == ENEMY) {
				map[enemy[i].x][enemy[i].y] = SPACE;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYBEAN) {
				map[enemy[i].x][enemy[i].y] = BEAN;
			}
			else if (map[enemy[i].x][enemy[i].y] == ENEMYSBEAN) {
				map[enemy[i].x][enemy[i].y] = SBEAN;
			}
			enemy[i] = next;
			map[enemy[i].x][enemy[i].y] = ENEMYSBEAN;
			break;
		}
	}
}
DIR EnemyBFS(int xx,int xy) {
	int dx[4], dy[4];
	int rnd[4];
	DIR vis[ROW][COL] = { NONE };
	int oridx[4] = { 0,0,-1,1 };
	int oridy[4] = { 1,-1,0,0 };
	DIR oridir[4] = { RIGHT,LEFT,UP,DOWN };
	DIR dr[4];
	Point v[ROW][COL];
	rnd[0] = rand() % 4;
	for (int i = 1; i < 4; i++) {
		bool x = 1;
		while (x) {
			rnd[i] = rand() % 4, x = 0;
			for (int j = 0; j < i; j++) if (rnd[i] == rnd[j]) x = 1;
		}
	}
	for (int i = 0; i < 4; i++) dx[i] = oridx[rnd[i]], dy[i] = oridy[rnd[i]], dr[i] = oridir[rnd[i]];
	std::queue<Point> q;
	q.push({ xx,xy });
	for (int i = 0; i < ROW; i++)
		for (int j = 0; j < COL; j++)
			if (map[i][j] != WALL) vis[i][j] = WAITING;
			else vis[i][j] = NONE;
	vis[xx][xy] = NONE;
	v[xx][xy] = { xx,xy };
	while (!q.empty()) {
		int _x_ = q.front().x, _y_ = q.front().y; q.pop();
		if (_x_ == player.x && _y_ == player.y) {
			Point t = { player.x,player.y }, lst = t;
			while (v[t.x][t.y].x!=t.x||v[t.x][t.y].y!=t.y) {
				lst = t;
				t = v[t.x][t.y];
			}
			int gox = lst.x, goy = lst.y;
			for (int i = 0; i < 4; i++) {
				if (xx + oridx[i] == gox && xy + oridy[i] == goy) return oridir[i];
			}
			return NONE;
		}
		for (int i = 0; i < 4; i++) {
			int nx = _x_ + dx[i], ny = _y_ + dy[i];
			if (vis[nx][ny] == WAITING) {
				vis[nx][ny] = dr[i];
				v[nx][ny] = { _x_,_y_ };
				q.push({ nx,ny });
			}
		}
	}
	return NONE;
}
void enemyControl() {
	srand((unsigned int)time(NULL));
	while (1) {
		for (int i = 0; i < 4; i++) {
			/*int r = player.x;
			int c = player.y;
			int r2 = enemy[i].x;
			int c2 = enemy[i].y;
			int m = rand() % 2 + 1;
			switch (m) {
			case 1:
				if (r < r2 && map[r2 - 1][c2] != WALL) {
					enemy[i].dir = UP;
				}
				else if (r > r2 && map[r2 + 1][c2] != WALL) {
					enemy[i].dir = DOWN;
				}
				else if (c < c2 && map[r2][c2 - 1] != WALL) {
					enemy[i].dir = LEFT;
				}
				else if (c > c2 && map[r2][c2 + 1] != WALL) {
					enemy[i].dir = RIGHT;
				}
				else {
					int n = rand() % 4 + 1;
					switch (n) {
					case 1:
						enemy[i].dir = UP;
						break;
					case 2:
						enemy[i].dir = DOWN;
						break;
					case 3:
						enemy[i].dir = LEFT;
						break;
					case 4:
						enemy[i].dir = RIGHT;
					}
				}
				break;
			case 2:
				if (r < r2 && map[r2 - 1][c2] != WALL) {
					enemy[i].dir = UP;
				}
				else if (r > r2 && map[r2 + 1][c2] != WALL) {
					enemy[i].dir = DOWN;
				}
				else if (c < c2 && map[r2][c2 - 1] != WALL) {
					enemy[i].dir = LEFT;
				}
				else if (c > c2 && map[r2][c2 + 1] != WALL) {
					enemy[i].dir = RIGHT;
				}
				else {
					int n = rand() % 4 + 1;
					switch (n) {
					case 1:
						enemy[i].dir = UP;
						break;
					case 2:
						enemy[i].dir = DOWN;
						break;
					case 3:
						enemy[i].dir = LEFT;
						break;
					case 4:
						enemy[i].dir = RIGHT;
					}
				}
				break;
			}*/
			enemy[i].dir = EnemyBFS(enemy[i].x, enemy[i].y);
			Sleep(300);
		}
	}
}
bool isWin() {
	for (int i = 0; i < ROW; i++) {
		for (int j = 0; j < COL; j++) {
			if (map[i][j] == BEAN  || map[i][j] == SBEAN) return false;
		}
	}
}
int main() {
	initgraph(WIDTH, HEIGHT);
	CreateThread(NULL, NULL, (LPTHREAD_START_ROUTINE)enemyControl, NULL, NULL, NULL);
	mciSendString("open 1.mp3", 0, 0, 0);
	mciSendString("play 1.mp3 repeat", 0, 0, 0);
	int s = 0;
	srand((unsigned int)time(NULL));
	do {
		m = rand() % ROW;
		n = rand() % COL;
	} while (map[m][n] == WALL || map[m][n] == ENEMY);
	BeginBatchDraw();
	initMap();
	while (life) {
		drawMap();
		do {
			m = rand() % ROW;
			n = rand() % COL;
		} while (map[m][n] == WALL);
		if (t1 - t2 >= 150) {
			movePlayer();
			t2 = t1;
		}
		if (t3 - t4 >= speed) {
			moveEnemy();
			t4 = t3;
		}
		if (t5 - t6 >= 10000 && willGo == false) {
			willGo = true;
			t6 = t5;
		}
		t1 = GetTickCount64();
		t3 = GetTickCount64();
		t5 = GetTickCount64();
		keyDown();
		//enemyControl();
		if (isWin()) {
			s++;
			if (s == 3) {
				mciSendString("close 1.mp3", 0, 0, 0);
				mciSendString("open 2.mp3", 0, 0, 0);
				mciSendString("play 2.mp3", 0, 0, 0);
				break;
			}
		}
		FlushBatchDraw();
	}
	EndBatchDraw();
	closegraph();
	return 0;
}

嘿嘿，竟然真的有人看完了整篇博客？欸嘿，那肯定要送一点福利呀，简单给个预告，下一篇很可能是关于flappy bird的游戏的，大家敬请期待

C++小盆友
关注
专栏目录
VisualStudio2022 C++ EasyX EGE简易版打地鼠
一个活泼初中生的博客
08-14 68
C++EasyX打地鼠终于来啦！
VS2022 C++ EasyX EGE 游戏开发之吃豆人1.0
一个活泼初中生的博客
12-04 813
VS2022 EGE 终于出来啦！大家赶紧来看看！教程详细哦！
VS2022安装EasyX 及 EasyX图形库安装和使用(附C++各图形编程项目示例源码)
Bit_Dong的博客
03-09 2万+
VS2022安装EasyX 及 EasyX图形库安装和使用(附C++各图形编程项目示例源码) EasyX 是针对 C++的图形库，可以帮助 C 语言初学者快速上手图形和游戏编程。 比如，可以用 VC + EasyX 很快的用几何图形画一个房子，或者一辆移动的小车，可以编写俄罗斯方块、贪吃蛇、黑白棋等小游戏可以练习图形学的各种算法等等。一、EasyX的安装 二、C++_EasyX 项目 1. 樱花2. 雪花3. 小熊4. 跳动爱心5. 橘子钟表6. 红玫瑰7. 奥特曼8. 五星红旗
VS2022安装easyx图形库教程
我的博客
02-23 3671
VS安装easyx图形库教程
visual studio 2022.c++easyx背景图片导入
lgf_202334的博客
07-14 372
想要导入照片最主要的就是准确找到相应的地址，就是这个----> D:\\作业\\c++\\2024.7.13\\2024.7.13\\tupian\\123.jpg。这里有的可能会报错，解决方法：点击项目---选什么什么属性--高级--字符集--右边框有个小标选：使用多字节字符集。有的图片从网上下载，可能加载不出来，这里需要导入画图中，当然也可以通过画图改变图片的大小来适应窗口的大小。复制这个地址（注意要改为\\）再加上\\123.jpg(看图片格式)，就行了！上有详细的讲解，这里就不讲述了。
【VS2022 | Easyx 报错 】textheight textwidth outtextxy 函数 报错 解决方案
CPT1024
05-07 3173
右击项目属性 使用多字节字符集 问题解决
Visual Studio下安装C/C++图形库（easyx）2022版
热门推荐
m0_57037805的博客
09-29 2万+
这里演示的是在Visual Studio 2022下安装C/C++图形库（easyx），简单易懂，从此告别黑乎乎的窗口。
easyx无法识别VS2022的问题
weixin_74179432的博客
05-28 1781
修改过后，这一次共享组件的路径可以修改了，我没敢修改，直接按照系统默认的在C盘里就好了。然后俺的easyx就能够识别我的VS2022了！，（下载的时候，我的这个共享组件的路径D盘的，并且无法修改）所以我又参照这篇文章进行了修改。1.先完全删除VS2022。
贪吃蛇c++版（easyx图形库）（vs2022编译并附完整代码）
m0_74242327的博客
08-02 3930
1.总设计要求1.总设计要求设计一个贪吃蛇小游戏蛇能通过键盘操作进行上下左右移动，能够躲避障碍物吃到食物，如果碰到墙壁或者自己身体会死亡。游戏界面，设置界面和帮助界面可以通过鼠标操作进行操控。：控制一条贪吃蛇在游戏区域内移动，吃到食物会变长，碰到墙壁或自己的身体会游戏结束。：包括账户认证登录，贪吃蛇的移动、食物的生成、得分统计、游戏难度设置等基本功能。：使用c++中的vector容器存储贪吃蛇的身体，使用随机数生成食物的位置，使用循环算法检测是否碰撞到自己的身体。
吃豆人C/c++实现
05-01
吃豆人是一款经典的电子游戏，它的C/C++实现展示了如何在命令行环境下创建一个互动的游戏。这个项目将涉及几个关键的编程概念和技术，包括游戏循环、图形绘制、碰撞检测、路径寻找以及对象交互。 首先，我们要理解...
怎么vs2022上安装graphics.h EasyX
10-22
在Visual Studio 2022 (VS2022) 中使用`graphics.h`和EasyX库进行图形编程，需要经过一系列步骤来安装和配置。`graphics.h`是C++中一个旧的图形库，主要用于DOS环境，而EasyX是针对Windows环境的一个现代替代品，它...
C++ STL中sort函数
weixin_43349440的博客
09-15 269
刷题中经常遇到，用于各种元素排序，可以自定义排序方式，vector、deque适用。详细讲解：https://zhuanlan.zhihu.com/p/36274119。，为避免QuickSort快排的递归调用带来过大的额外负荷，就改用。一旦分段后的数据量小于某个门槛。STL的sort算法，
CF C. Nikita and LCM
qq_74190237的博客
09-13 270
思维题.首先先对数组排序,考虑一种特殊情况,那就是如果数组最大值不能被其他数整除,这代表什么?代表其他数里面有某个质因子,最大值里面没有或者数量不管,所有最小公倍数都会大于最大值.那么其他情况的话,就可以确定所有的数都是最大数的因子,那么形成的最小公倍数也一定是最大数的因子,那么就可以枚举一下最大数的因子,就可以了.给长度为n的数组,求出最长的特殊子数组,如果子数组的最小公倍数不在原数组中,那么就是特殊的.
C++与QML的数据交互
qq_50679120的博客
09-11 525
这里没什么好说的，在C++中组合好json后，通过信号发送到qml中，qml中是可以解析json的。通过Q_PROPERTY属性，可以轻松地在QML中读取和修改数据，并将其更新到C++中，先创建一个类。在QML接收，直接通过data.can_id这样的形式去访问结构体中的元素。这两个也没什么好说的，在C++中直接发送信号就好了，在C++中声明并注册一个结构体。然后发送信号到QML中。
C++_map_set详解
最新发布
2302_77644537的博客
09-16 641
set是按照一定次序存储元素的容器在set中，元素的value也标识它(value就是key，类型为T)，并且每个value必须是唯一的。set中的元素不能在容器中修改(元素总是const)，但是可以从容器中插入或删除它们。在内部，set中的元素总是按照其内部比较对象(类型比较)所指示的特定严格的排序准则（默认是小于）进行排序。set在底层是用二叉搜索树(红黑树)实现的。map是关联容器，它按照特定的次序(按照key来比较)存储由键值key和值value组合而成的元素。
C语言从头学59——学习头文件math.h（二）
m0_72128260的博客
09-11 557
继续学习头文件的数学函数。
C++ 中 vector 的常用功能介绍
2202_75569688的博客
09-12 428
在 C++ 中，vector是一种常用的动态数组容器，提供了方便的自动扩展、内存管理以及各种便捷的操作方法。它是 C++ 标准模板库（STL）的一部分，适用于需要动态存储和管理大量元素的场景。在本文中，我们将简要介绍vector的常用功能，展示如何对其进行操作和排序。为了简洁起见，假设我们已经使用了。
【C++ && Qt day11】
wzj46的博客
09-11 274
2、头文件窗口文件。
评论 7
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

C++小盆友

你的鼓励将是我创作的最大动力呦

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值