恶心人游戏
2025-02-14 16:10:23
发布于：北京
40阅读
0回复
0点赞
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
int map[3][15][20] =
{
//0:空的 1:■ :墙
//3：☆ 4：★ //目的地和箱子
//5：※ //人
//7:⊙ //目的(3)和箱子(4)在一起
//8：※ //人(5)和目的(3)在一起
//为让多种情况使用一种算法
{
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,1,1,1,1,1,1,0,1,0,0,0,0,1,
1,1,1,1,1,1,0,1,0,0,0,0,1,0,1,1,1,1,0,1,
1,3,1,0,0,0,0,0,0,4,0,0,1,0,1,3,0,0,0,1,
1,0,1,0,0,0,0,0,0,1,1,0,1,0,1,0,1,0,1,1,
1,0,1,1,1,1,1,1,0,0,1,0,1,0,1,1,1,0,1,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,
1,0,0,0,0,1,1,1,1,0,1,1,1,0,0,1,0,4,0,1,
1,0,0,4,0,0,0,1,1,0,1,0,0,4,0,1,0,0,0,1,
1,0,0,1,0,0,0,1,1,0,1,0,4,0,0,0,0,0,0,1,
1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,1,0,1,0,1,1,1,1,1,1,1,1,1,0,0,0,1,
1,0,0,1,0,0,5,0,0,3,1,3,0,0,0,0,0,0,0,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
},
{
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
},
{
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
}
};
int cas = 0; //为0表示第一关
//记录每一关的箱子数 或者是项目和目的在一起的总数
int boxSum[3] = {3,4,5};
//地图绘图
void drawMap()
{
for (int i = 0; i < 15; i++)
{
for (int j = 0; j < 20; j++)
{
if (j == 0)
printf("\t\t");
switch (map[cas][i][j])
{
// //0:空的 1:■ :墙
case 0:
printf(" ");
break;
case 1:
printf("■");
break;
//3：☆ 4：★ //目的地和箱子
case 3:
printf("☆");
break;
case 4:
printf("★");
break;
//5：※ //人
case 5:
case 8:
printf("※");
break;
case 7:
printf("⊙");
break;
//7:⊙ //目的(3)和箱子(4)在一起
//8：※ //人(5)和目的(3)在一起
}
}
printf("\n");
}
}
//按键处理
void keyDown()
{
//分析按键过程
//定位人在哪里
//人有两种情况：第一个是：人，第二个：人站在目的上
int i, j;
for (i = 0; i < 15; i++)
{
for (j = 0; j < 20; j++)
{
if (map[cas][i][j] == 5 || map[cas][i][j] == 8)
{
break;
}
}
if (map[cas][i][j] == 5 || map[cas][i][j] == 8)
{
break;
}
}
char ch = _getch(); //看不见的字符输入，+头文件 conio.h
switch (ch)
{
//72 80 75 77
case 'w':
case 'W':
case 72:
//下一个地方等于空地或者是目的 能走
if (map[cas][i - 1][j] == 0 || map[cas][i - 1][j] == 3)
{
//3+5=8 ：表示目的和人在一起
//新地方(map[i-1][j])人（5）来了
map[cas][i - 1][j] += 5;
//老地方(map[i][j])人（5）走了
map[cas][i][j] -= 5;
}
//如果下一个是箱子，要进一步判断能走
//注意点：箱子两种状态：箱子，箱子和目的在一起
else if (map[cas][i - 1][j] == 4 || map[cas][i - 1][j] == 7)
{
//做箱子的下一个地方判断能不能走
if (map[cas][i - 2][j] == 0 || map[cas][i - 2][j] == 3)
{
//新的地方箱子来了
map[cas][i - 2][j] += 4;
//箱子的位置：箱子（-4）走了 人来（+5）
map[cas][i - 1][j] += 1;
//原来的地方人走了
map[cas][i][j] -= 5;
}
}
break;
case 's':
case 'S':
case 80:
//下一个地方等于空地或者是目的 能走
if (map[cas][i + 1][j] == 0 || map[cas][i + 1][j] == 3)
{
//3+5=8 ：表示目的和人在一起
//新地方(map[i-1][j])人（5）来了
map[cas][i + 1][j] += 5;
//老地方(map[i][j])人（5）走了
map[cas][i][j] -= 5;
}
else if (map[cas][i + 1][j] == 4 || map[cas][i + 1][j] == 7)
{
//做箱子的下一个地方判断能不能走
if (map[cas][i + 2][j] == 0 || map[cas][i + 2][j] == 3)
{
//新的地方箱子来了
map[cas][i + 2][j] += 4;
//箱子的位置：箱子（-4）走了 人来（+5）
map[cas][i + 1][j] += 1;
//原来的地方人走了
map[cas][i][j] -= 5;
}
}
break;
case 'a':
case 'A':
case 75:
//下一个地方等于空地或者是目的 能走
if (map[cas][i][j - 1] == 0 || map[cas][i][j - 1] == 3)
{
//3+5=8 ：表示目的和人在一起
//新地方(map[i-1][j])人（5）来了
map[cas][i][j - 1] = map[cas][i][j - 1] + 5;
//老地方(map[i][j])人（5）走了
map[cas][i][j] = map[cas][i][j] - 5;
//j+=5 j=j+5
}
else if (map[cas][i][j - 1] == 4 || map[cas][i][j - 1] == 7)
{
//做箱子的下一个地方判断能不能走
if (map[cas][i][j - 2] == 0 || map[cas][i][j - 2] == 3)
{
//新的地方箱子来了
map[cas][i][j - 2] += 4;
//箱子的位置：箱子（-4）走了 人来（+5）
map[cas][i][j - 1] += 1;
//原来的地方人走了
map[cas][i][j] -= 5;
}
}
break;
case 'D':
case 'd':
case 77:
//下一个地方等于空地或者是目的 能走
if (map[cas][i][j + 1] == 0 || map[cas][i][j + 1] == 3)
{
//3+5=8 ：表示目的和人在一起
//新地方(map[i-1][j])人（5）来了
map[cas][i][j + 1] += 5;
//老地方(map[i][j])人（5）走了
map[cas][i][j] -= 5;
}
//下一个地方是箱子，判断箱子的下一个地方是不是目的和空地
else if (map[cas][i][j + 1] == 4 || map[cas][i][j + 1] == 7)
{
//做箱子的下一个地方判断能不能走
if (map[cas][i][j + 2] == 0 || map[cas][i][j + 2] == 3)
{
//新的地方箱子来了
map[cas][i][j + 2] += 4;
//箱子的位置：箱子（-4）走了 人来（+5）
map[cas][i][j + 1] += 1;
//原来的地方人走了
map[cas][i][j] -= 5;
}
}
break;
}
}
//胜负判断
//用什么判断胜负： 箱子到达目的的个数
int gameOver()
{
int count = 0;
//所有的地方找一遍
for (int i = 0; i < 15; i++)
{
for (int j = 0; j < 20; j++)
{
if (map[cas][i][j] == 7)
count++;
}
}
return count;
}
//箱子数是零的时候也是胜利
int gameOver2()
{
int count = 3;
//所有的地方找一遍
for (int i = 0; i < 15; i++)
{
for (int j = 0; j < 20; j++)
{
if (map[cas][i][j] == 3)
count--;
}
}
return count;
}
int main(){
printf("制作: 当心草原上的猎应\n");
while (1)
{
printf("\n\t用方向键或w a s d键移动※推动★进入☆\n",cas+1);
printf("\n\t\t 共三关 第 %d 关\n",cas+1);
drawMap();
if (gameOver() == boxSum[cas])
{
cas++;
if (cas == 3)
break;
else
printf("\n\t\t 该关 OK！按任一键进继续\n");
}
keyDown();
system("cls");
}
printf("游戏结束！");
printf("\n");
system("pause");
return 0;
}
有帮助，赞一个