基于C语言的迷宫探险游戏设计 c语言教程学习攻略

小粥学姐

于 2024-10-10 21:00:49 发布

阅读量555

点赞数 22

文章标签： c语言游戏学习 csdn c# 游戏程序

本文链接：https://blog.csdn.net/m0_72216164/article/details/142832151

版权

游戏简介

C语言完整代码

C语言自学攻略及功能解析

游戏简介

“迷宫探险”是一款基于文本界面的冒险游戏，玩家需要控制一个探险者在迷宫中寻找宝藏并最终逃出迷宫。迷宫由一系列的房间组成，每个房间有四面墙（北、南、东、西），部分墙上有门可以通行。游戏开始时，探险者位于迷宫的入口，目标是找到并收集宝藏，然后找到迷宫的出口。在探险过程中，玩家可能会遇到陷阱（如掉落的石块、突然关闭的门），需要巧妙避开或解决这些障碍。游戏设定了有限的步数，玩家需要在步数耗尽前完成任务，否则游戏结束。

C语言完整代码

c复制代码

	#include <stdio.h>
	#include <stdlib.h>
	#include <stdbool.h>
	#include <time.h>

	#define ROWS 5
	#define COLS 5
	#define MAX_STEPS 20

	typedef struct {
	int x, y;
	bool hasTreasure;
	bool isExit;
	} Room;

	typedef struct {
	Room maze[ROWS][COLS];
	int playerX, playerY;
	int steps;
	} GameState;

	void initializeGame(GameState *state) {
	// 初始化迷宫，设置宝藏和出口位置
	state->maze[0][0].x = 0; state->maze[0][0].y = 0; state->maze[0][0].hasTreasure = false; state->maze[0][0].isExit = false;
	state->maze[1][0].x = 1; state->maze[1][0].y = 0; state->maze[1][0].hasTreasure = false; state->maze[1][0].isExit = false;
	state->maze[1][1].x = 1; state->maze[1][1].y = 1; state->maze[1][1].hasTreasure = true; state->maze[1][1].isExit = false;
	state->maze[1][2].x = 1; state->maze[1][2].y = 2; state->maze[1][2].hasTreasure = false; state->maze[1][2].isExit = false;
	state->maze[2][2].x = 2; state->maze[2][2].y = 2; state->maze[2][2].hasTreasure = false; state->maze[2][2].isExit = false;
	state->maze[2][3].x = 2; state->maze[2][3].y = 3; state->maze[2][3].hasTreasure = false; state->maze[2][3].isExit = true;
	state->maze[3][3].x = 3; state->maze[3][3].y = 3; state->maze[3][3].hasTreasure = false; state->maze[3][3].isExit = false;
	state->maze[4][3].x = 4; state->maze[4][3].y = 3; state->maze[4][3].hasTreasure = false; state->maze[4][3].isExit = false;
	state->maze[4][2].x = 4; state->maze[4][2].y = 2; state->maze[4][2].hasTreasure = false; state->maze[4][2].isExit = false;
	state->maze[4][1].x = 4; state->maze[4][1].y = 1; state->maze[4][1].hasTreasure = false; state->maze[4][1].isExit = false;

	// 玩家初始位置
	state->playerX = 0;
	state->playerY = 0;

	// 初始化步数
	state->steps = MAX_STEPS;
	}

	void printMaze(GameState *state) {
	for (int i = 0; i < ROWS; i++) {
	for (int j = 0; j < COLS; j++) {
	if (state->maze[i][j].x == state->playerX && state->maze[i][j].y == state->playerY) {
	printf("P "); // 玩家位置
	} else if (state->maze[i][j].hasTreasure) {
	printf("T "); // 宝藏位置
	} else if (state->maze[i][j].isExit) {
	printf("E "); // 出口位置
	} else {
	printf(". "); // 空地
	}
	}
	printf("\n");
	}
	}

	bool movePlayer(GameState *state, char direction) {
	int newX = state->playerX;
	int newY = state->playerY;

	switch (direction) {
	case 'n': newX--; break;
	case 's': newX++; break;
	case 'e': newY++; break;
	case 'w': newY--; break;
	default: return false; // 无效指令
	}

	// 检查新位置是否在迷宫范围内且没有墙
	if (newX >= 0 && newX < ROWS && newY >= 0 && newY < COLS &&
	!(state->maze[newX][newY].x == -1 \|\| state->maze[newX][newY].y == -1)) { // 简化版检查，实际应更细致
	state->playerX = newX;
	state->playerY = newY;
	state->steps--;
	return true;
	}

	return false; // 无法移动
	}

	bool gameOver(GameState *state) {
	return state->steps <= 0 \|\| (state->maze[state->playerX][state->playerY].isExit && state->maze[state->playerX][state->playerY].hasTreasure);
	}

	int main() {
	GameState state;
	initializeGame(&state);
	char direction;
	bool gameWon = false;

	printf("欢迎来到迷宫探险游戏！\n");
	printf("你需要找到宝藏（T）并逃到出口（E）。\n");
	printf("使用 'w' 上, 's' 下, 'e' 右, 'n' 左来移动。\n");
	printf("你的步数有限，祝你好运！\n\n");

	while (!gameOver(&state)) {
	printMaze(&state);

	if (state->maze[state->playerX][state->playerY].hasTreasure) {
	printf("你找到了宝藏！继续寻找出口。\n");
	}

	printf("输入移动指令: ");
	scanf(" %c", &direction);

	if (!movePlayer(&state, direction)) {
	printf("无法移动，请重试。\n");
	}

	if (state->maze[state->playerX][state->playerY].isExit && state->maze[state->playerX][state->playerY].hasTreasure) {
	gameWon = true;
	}
	}

	if (gameWon) {
	printMaze(&state);
	printf("恭喜你，你找到了宝藏并成功逃出迷宫！\n");
	} else {
	printMaze(&state);
	printf("很遗憾，你的步数用完了或未能完成任务。游戏结束。\n");
	}

	return 0;
	}