本项目采用了无阻塞输入
#include<iostream>
#include<conio.h>
#include<stdio.h>
#include<stdlib.h>
#include<ctime>
#include<Windows.h>
using namespace std;
int GameMap[15][10] = { { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } };
int Grade = 0;//定义一个变量,存储游戏分数,并赋初始值为0
void print()//地图的输出
{
system("CLS");//清屏
cout << "游戏分数:" << Grade << endl;
for (int i = 0; i < 15; i++)
{
for (int j = 0; j < 10; j++)
{
switch (GameMap[i][j])
{
case 0:
cout << "1";
break;
case 1:
cout << "*";
break;
}
}
cout << endl;
}
}
void Pause()//游戏暂停
{
while (true)
{
system("CLS");
cout << "游戏暂停!" << endl;
cout << "按空格键继续!" << endl;
int Input = getch();
if (' ' == Input)
{
break;
}
}
}
int main()
{
//定义一个数组,存储地图数据
srand(time(NULL));
while (true)
{
//随机生成方块
int n = rand()%5;
for (int i = 0; i < 15;)
{
for (int j = 0; j < 10;)
{
switch (n)
{
case 0://2*2正方形方块
print();
GameMap[i][j] = 1;
GameMap[i][j + 1] = 1;
GameMap[i + 1][j] = 1;
GameMap[i + 1][j + 1] = 1;
break;
case 1://5*1长方形方块
GameMap[i][j] = 1;
GameMap[i][j + 1] = 1;
GameMap[i][j + 2] = 1;
GameMap[i][j + 3] = 1;
GameMap[i][j + 4] = 1;
break;
case 2://2个直角的方块
GameMap[i][j] = 1;
GameMap[i][j + 1] = 1;
GameMap[i + 1][j + 1] = 1;
GameMap[i + 1][j + 2] = 1;
break;
case 3://1*1小方块
GameMap[i][j] = 1;
break;
case 4://正7字形方块
GameMap[i][j] = 1;
GameMap[i][j + 1] = 1;
GameMap[i + 1][j + 1] = 1;
GameMap[i + 2][j + 1] = 1;
break;
}
print();
Sleep(100);//每0.1s刷新一次
if (_kbhit())//非阻塞获取用户输入
{
int Input = _getch();
//2*2正方形方块移动
if (0 == n)//判断是否还可以移动
{
if (i + 2 >= 15 || 1 == GameMap[i + 2][j] || 1 == GameMap[i + 2][j + 1])
{
goto lab1;
}
switch (Input)
{
//下移
case 's':
case 'S':
if (i + 2 < 15 && 0 == GameMap[i + 2][j] && 0 == GameMap[i + 2][j + 1])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
i++;
}
break;
//左移
case 'a':
case 'A':
if (j > 0 && 0 == GameMap[i][j - 1] && 0 == GameMap[i + 1][j - 1])
{
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
j--;
}
break;
//右移
case 'd':
case 'D':
if (j + 2 < 10 && 0 == GameMap[i][j + 2] && 0 == GameMap[i + 1][j + 2])
{
GameMap[i][j] = 0;
GameMap[i + 1][j] = 0;
j++;
}
break;
case'k':
case 'K':
Pause();
break;
}
}
//1*5长方形方块移动
else if (1 == n)
{
//判断是否还可以移动
if (i + 1 >= 15 || (1 == GameMap[i + 1][j + 1] || 1 == GameMap[i + 1][j + 2] || 1 == GameMap[i + 1][j + 3] || 1 == GameMap[i + 1][j + 4] || 1 == GameMap[i + 1][j]))
{
goto lab1;
}
switch (Input)
{
//下移
case 's':
case 'S':
if (i + 1 < 15 && 0 == GameMap[i + 1][j + 1] && 0 == GameMap[i + 1][j + 2] && 0 == GameMap[i + 1][j + 3] && 0 == GameMap[i + 1][j + 4] && 0 == GameMap[i + 1][j])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i][j + 2] = 0;
GameMap[i][j + 3] = 0;
GameMap[i][j + 4] = 0;
i++;
}
break;
//左移
case 'a':
case 'A':
if (j > 0 && 0 == GameMap[i][j - 1])
{
GameMap[i][j + 4] = 0;
j--;
}
break;
//右移
case 'd':
case 'D':
if (j + 5 < 10 && 0 == GameMap[i][j + 5])
{
GameMap[i][j] = 0;
j++;
}
break;
case'k':
case 'K':
Pause();
break;
}
}
//2个直角的方块的方块移动
else if (2 == n)
{
//判断是否还可以移动
if (i + 2 >= 15 || 1 == GameMap[i + 1][j] || 1 == GameMap[i + 2][j + 1] || 1 == GameMap[i + 2][j + 2])
{
goto lab1;
}
switch (Input)
{
//下移
case 's':
case 'S':
if (i + 2 < 15 && 0 == GameMap[i + 1][j] && 0 == GameMap[i + 2][j + 1] && 0 == GameMap[i + 2][j + 2])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 1][j + 2] = 0;
i++;
}
break;
//左移
case 'a':
case 'A':
if (j > 0 && 0 == GameMap[i][j - 1] && 0 == GameMap[i - 1][j])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 1][j + 2] = 0;
j--;
}
break;
//右移
case 'd':
case 'D':
if (j + 3 < 10 && 0 == GameMap[i + 1][j + 3] && 0 == GameMap[i][j + 2])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 1][j + 2] = 0;
j++;
}
break;
case'k':
case 'K':
Pause();
break;
}
}
//1*1小方块
else if (3 == n)
{
Sleep(300);
//判断是否还可以移动
if (i + 1 >= 15 || 1 == GameMap[i + 1][j])
{
goto lab1;
}
switch (Input)
{
//下移
case 's':
case 'S':
if (i + 1 < 15 && 0 == GameMap[i + 1][j])
{
GameMap[i][j] = 0;
i++;
}
break;
//左移
case 'a':
case 'A':
if (j > 0 && 0 == GameMap[i][j - 1])
{
GameMap[i][j] = 0;
j--;
}
break;
//右移
case 'd':
case 'D':
if (j + 1 < 10 && 0 == GameMap[i][j + 1])
{
GameMap[i][j] = 0;
j++;
}
break;
case'k':
case 'K':
Pause();
break;
}
}
//7字形方块的移动
else if (4 == n)
{
//判断是否还可以移动
if (i + 3 >= 15 || 1 == GameMap[i + 1][j] || 1 == GameMap[i + 3][j + 1])
{
goto lab1;
}
switch (Input)
{
//下移
case 's':
case 'S':
if (i + 3 < 15 && 0 == GameMap[i + 1][j] && 0 == GameMap[i + 3][j + 1])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 2][j + 1] = 0;
i++;
}
break;
//左移
case 'a':
case 'A':
if (j > 0 && 0 == GameMap[i][j - 1] && 0 == GameMap[i + 1][j] && 0 == GameMap[i + 2][j])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 2][j + 1] = 0;
j--;
}
break;
//右移
case 'd':
case 'D':
if (j + 2 < 10 && 0 == GameMap[i + 1][j + 2] && 0 == GameMap[i + 2][j + 2] && 0 == GameMap[i + 3][j + 2])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 2][j + 1] = 0;
j++;
}
break;
case'k':
case 'K':
Pause();
break;
}
}
}
else//如果从键盘中没有获获取任何东西
{
Sleep(300);//每0.3S自动移动一次
if (0 == n)
{
//判断是否还可以移动
if (i + 2 >= 15 || 1 == GameMap[i + 2][j] || 1 == GameMap[i + 2][j + 1])
{
goto lab1;
}
//自动向下移动
if (i + 2 < 15 && 0 == GameMap[i + 2][j] && 0 == GameMap[i + 2][j + 1])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
i++;
}
}
if (1 == n)
{
//判断是否还可以移动
if (i + 1 >= 15 || 1 == GameMap[i + 1][j + 1] || 1 == GameMap[i + 1][j + 2] || 1 == GameMap[i + 1][j + 3] || 1 == GameMap[i + 1][j + 4] || 1 == GameMap[i + 1][j])
{
goto lab1;
}
//自动向下移动
if (i + 1 < 15 && 0 == GameMap[i + 1][j + 1] && 0 == GameMap[i + 1][j + 2] && 0 == GameMap[i + 1][j + 3] && 0 == GameMap[i + 1][j + 4] && 0 == GameMap[i + 1][j])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i][j + 2] = 0;
GameMap[i][j + 3] = 0;
GameMap[i][j + 4] = 0;
i++;
}
}
if (2 == n)
{
//判断是否还可以移动
if (i + 2 >= 15 || 1 == GameMap[i + 1][j] || 1 == GameMap[i + 2][j + 1] || 1 == GameMap[i + 2][j + 2])
{
goto lab1;
}
//自动向下移动
if (i + 2 < 15 && 0 == GameMap[i + 1][j] && 0 == GameMap[i + 2][j + 1] && 0 == GameMap[i + 2][j + 2])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 1][j + 2] = 0;
i++;
}
}
if (3 == n)
{
//判断是否还可以移动
if (i + 1 >= 15 || 1 == GameMap[i + 1][j])
{
goto lab1;
}
//自动向下移动
if (i + 1 < 15 && 0 == GameMap[i + 1][j])
{
GameMap[i][j] = 0;
i++;
}
}
if (4 == n)
{
//判断是否还可以移动
if (i + 3 >= 15 || 1 == GameMap[i + 1][j] || 1 == GameMap[i + 3][j + 1])
{
goto lab1;
}
//自动向下移动
if (i + 3 < 15 && 0 == GameMap[i + 1][j] && 0 == GameMap[i + 3][j + 1])
{
GameMap[i][j] = 0;
GameMap[i][j + 1] = 0;
GameMap[i + 1][j + 1] = 0;
GameMap[i + 2][j + 1] = 0;
i++;
}
}
}
}
}
//判断方块是否可以清除
lab1:int x=14, y=0;
for (; x>0; x--)
{
int num = 0;
int j = 0;
for (; j < 10; j++)
{
if (1 == GameMap[x][j])//判断每一行方块的个数
{
++num;
}
if (10 == num)//如果这一行全是方块
{
num = 0;
Grade += 10;//分数+10
//清除这一行的方块
for (j=0; j < 10; j++)
{
GameMap[x][j] = 0;
}
//清除的那一行方块,它上面的的所有方块,全部下移一层
for (int i = x; i > 0; i--)
{
for (int a = 0; a < 10; a++)
{
GameMap[i][a] = GameMap[i - 1][a];
}
}
x++;//移动后需要再次判断当前这一行是否全是方块
}
}
}
//判断游戏是否结束
for (int i = 0, j = 0; j < 10; j++)
{
if (1 == GameMap[i][j])
{
system("CLS");
cout << "游戏结束!" << endl;
goto lab2;
}
}
}
lab2:
return 0;
}