C語言實現(xiàn)俄羅斯方塊小游戲
更新時間：2020年04月01日 14:04:37 作者：半片瓜
這篇文章主要為大家詳細介紹了Linux下C語言實現(xiàn)俄羅斯方塊小游戲，文中示例代碼介紹的非常詳細，具有一定的參考價值，感興趣的小伙伴們可以參考一下
C語言實現(xiàn)俄羅斯方塊小游戲的制作代碼，具體內(nèi)容如下
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define TTY_PATH "/dev/tty"
#define STTY_ON "stty raw -echo -F"
#define STTY_OFF "stty -raw echo -F"
int map[21][14];
char direct;
int node[7][4][16]={
{{0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0},//長方形
{0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0},
{0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0},
{0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0}},
{{1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0},//正方形
{1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0},
{1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0},
{1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0}},
{{0,1,0,0,1,1,1,0,0,0,0,0,0,0,0,0},//3邊加一中點
{0,1,0,0,0,1,1,0,0,1,0,0,0,0,0,0},
{0,0,0,0,1,1,1,0,0,1,0,0,0,0,0,0},
{0,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0}},
{{0,1,1,0,0,1,0,0,0,1,0,0,0,0,0,0},//右鋤頭型
{0,0,0,0,1,1,1,0,0,0,1,0,0,0,0,0},
{0,1,0,0,0,1,0,0,1,1,0,0,0,0,0,0},
{1,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0}},
{{1,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0},//左鋤頭型
{0,0,1,0,1,1,1,0,0,0,0,0,0,0,0,0},
{0,1,0,0,0,1,0,0,0,1,1,0,0,0,0,0},
{0,0,0,0,1,1,1,0,1,0,0,0,0,0,0,0}},
{{0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,0},//右曲折型
{0,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0},
{0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,0},
{0,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0}},
{{0,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0},//左曲折型
{1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0},
{0,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0},
{1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0}}
};
typedef struct block
{
int x;
int y;
int blockType;
int blockDirect;
}Block;
Block bl;
void init_map()//初始化邊框
{
int i,j;
for(i=0; i<21; i++)
for(j=0; j<14; j++)
{
if(j==0 || j==13)
map[i][j] = 200;
else if(i==20)
map[i][j] = 201;
else
map[i][j] = 0;
}
}
void new_block()//生成隨機的俄羅斯方塊
{
int blockType = rand()%7;
int blockDirect = rand()%4;
int x = 1;
int y = 5;
bl.x = x;
bl.y = y;
bl.blockType = blockType;
bl.blockDirect = blockDirect;
}
void input()//將移動后的俄羅斯方塊，導(dǎo)入地圖中作標記
{
int i, j;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j]==1)
{
map[bl.x+i][bl.y+j] = 1;
}
}
void output()//移動時，將之前俄羅斯方塊在地圖信息清空。
{
int i, j;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j]==1)
{
map[bl.x+i][bl.y+j] = 0;
}
}
void change()//俄羅斯方格在碰撞后融入，固定
{
int i, j;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j]==1)
{
map[bl.x+i][bl.y+j] = 10;
}
for(j=1; j<13; j++)
if(map[5][j] == 10)
{
system("clear");
printf("game over !!!!!!!!!\n");
exit(1);
}
}
void print_map()//打印地圖，顯示信息
{
int i,j;
for(i=5; i<21; i++)
{
for(j=0; j<14; j++)
{
if(map[i][j]==200)//左右邊界
printf("#");
else if(map[i][j]==201)//下邊界
printf(" # ");
else if(map[i][j]==0)//空白地
printf(" ");
else if(map[i][j]==1)//移動的俄羅斯方塊
printf(" * ");
else if(map[i][j]==10)//固定的俄羅斯方塊
printf(" @ ");
}
printf("\n");
}
}
void delLine(int n)//消行
{
int i,j;
for(j = 1; j<13; j++)
map[n][j] = 0;
for(i = n; i>5 ; i--)
for(j = 1; j<13; j++)
if(map[i-1][j] != 1)
map[i][j] = map[i-1][j];
}
void isFillLine()//是否滿足消行條件
{
int i,j;
int fals;
for(i=19; i>5; i--)
{
fals = 1;
for(j=1; j<13; j++)
{
if(map[i][j] != 10)
{
fals = 0;
continue;
}
}
if(fals)
{
delLine(i);
}
}
}
void down()//下移
{
int i, j;
int fale = 1;
for(i=3; i>=0; i--)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j] == 1)
if(map[bl.x+i+1][bl.y+j] == 10 || map[bl.x+i+1][bl.y+j] == 201)
{
change();
fale = 0;
new_block();
isFillLine();
return;
}
if(fale)
{
output();
bl.x += 1;
input();
}
}
void right()//右移
{
int i, j;
int fale = 1;
for(i=3; i>=0; i--)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j] == 1)
if(map[bl.x+i][bl.y+j+1] == 10 || map[bl.x+i][bl.y+j+1] == 200)
{
fale = 0;
return;
}
if(fale)
{
output();
bl.y += 1;
input();
}
}
void left()//左移
{
int i, j;
int fale = 1;
for(i=3; i>=0; i--)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j] == 1)
if(map[bl.x+i][bl.y+j-1] == 10 || map[bl.x+i][bl.y+j-1] == 200)
{
fale = 0;
return;
}
if(fale)
{
output();
bl.y -= 1;
input();
}
}
void change_block()//俄羅斯方塊變形
{
int i,j;
output();
int fals = 1;
bl.blockDirect += 1;
bl.blockDirect %= 4;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(node[bl.blockType][bl.blockDirect][i*4+j]==1)
if(map[bl.x+i][bl.y+j] != 0 )
{
fals = 0;
break;
}
if(fals)
{
input();
}else
{
bl.blockDirect -= 1;
input();
}
}
char in_direct()//非堵塞輸入
{
fd_set fd;
struct timeval tv;
char ch;
FD_ZERO(&fd);
FD_SET(0, &fd);
tv.tv_sec = 0;
tv.tv_usec = 10;
if(select(1, &fd ,NULL, NULL, &tv) > 0)
{
ch = getchar();
}
return ch;
}
int main()//q 退出游戲，a,d 左右移動，空格變形
{
srand(time(NULL));
init_map();
new_block();
input();
char ch;
int num = 0;
while(1)
{
usleep(500000);
system(STTY_ON TTY_PATH);
ch = in_direct();
system(STTY_OFF TTY_PATH);
system("clear");
if(ch == 'a' && num <= 1)
{
left();
print_map();
num++;
continue;
}else if(ch == 'd' && num <= 1)
{
right();
print_map();
num++;
continue;
}else if(ch == ' ' && num <= 1 )
{
change_block();
print_map();
num++;
continue;
}else if(ch == 'q')
{
system("clear");
printf("gave over!!!!!\n");
exit(0);
}
down();
print_map();
num = 0;
}
return 0;
}
更多俄羅斯方塊精彩文章請點擊專題：俄羅斯方塊游戲集合 進行學(xué)習(xí)。
更多有趣的經(jīng)典小游戲?qū)崿F(xiàn)專題，分享給大家：
以上就是本文的全部內(nèi)容，希望對大家的學(xué)習(xí)有所幫助，也希望大家多多支持腳本之家。
相關(guān)文章
C++ OpenCV實戰(zhàn)之標記點檢測的實現(xiàn)
這篇文章主要介紹了如何利用C++ OpenCV實現(xiàn)關(guān)鍵點的檢測，文中的示例代碼講解詳細，對我們學(xué)習(xí)OpenCV有一定幫助，感興趣的小伙伴可以了解一下2022-03-03
這篇文章主要為大家詳細介紹了C++實現(xiàn)動態(tài)順序表，文中示例代碼介紹的非常詳細，具有一定的參考價值，感興趣的小伙伴們可以參考一下2020-05-05
遞歸，大家都了解，著名的斐波那契數(shù)，就為該知識點的經(jīng)典例題。今天來看看更為經(jīng)典的遞歸題漢諾塔不過這其實是數(shù)學(xué)問題，先來看看漢諾塔2021-09-09
這篇文章主要為大家詳細介紹了C語言實現(xiàn)推箱子的基本功能的方法，文中示例代碼介紹的非常詳細，具有一定的參考價值，感興趣的小伙伴們可以參考一下，希望能夠給你帶來幫助2022-02-02
這篇文章主要介紹了C語言指針詳解及用法示例，介紹了其相關(guān)概念，然后分享了幾種用法，具有一定參考價值。需要的朋友可以了解下2021-09-09
這篇文章主要為大家詳細介紹了基于Qt+OpenCV的圖像灰度化像素操作：最大值法、平均法、加權(quán)平均值法，感興趣的小伙伴可以了解一下2022-07-07
C語言 數(shù)與串之間轉(zhuǎn)換的方法，需要的朋友可以參考一下2013-05-05
深入探討:宏、內(nèi)聯(lián)函數(shù)與普通函數(shù)的區(qū)別
本篇文章是對宏、內(nèi)聯(lián)函數(shù)與普通函數(shù)的區(qū)別進行了詳細的分析介紹，需要的朋友參考下2013-05-05
C++動態(tài)規(guī)劃實現(xiàn)查找最長公共子序列
這篇文章主要介紹了C++動態(tài)規(guī)劃最長公共子序列,在動態(tài)規(guī)劃中，你要將某個指標最大化。在這個例子中，你要找出最長公共子序列2022-06-06
fread()函數(shù)用來從指定文件中讀取塊數(shù)據(jù),下面這篇文章主要給大家介紹了關(guān)于C語言文件操作之fread函數(shù)的相關(guān)資料,文中通過實例代碼介紹的非常詳細,需要的朋友可以參考下2022-06-06