服务器之家

服务器之家 > 正文

C语言实现俄罗斯方块小游戏

时间:2021-05-26 13:59     来源/作者:半片瓜

C语言实现俄罗斯方块小游戏的制作代码,具体内容如下

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
#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()//将移动后的俄罗斯方块,导入地图中作标记
{
 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;
}

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持服务器之家。

相关文章

热门资讯

2020微信伤感网名听哭了 让对方看到心疼的伤感网名大全
2020微信伤感网名听哭了 让对方看到心疼的伤感网名大全 2019-12-26
yue是什么意思 网络流行语yue了是什么梗
yue是什么意思 网络流行语yue了是什么梗 2020-10-11
背刺什么意思 网络词语背刺是什么梗
背刺什么意思 网络词语背刺是什么梗 2020-05-22
苹果12mini价格表官网报价 iPhone12mini全版本价格汇总
苹果12mini价格表官网报价 iPhone12mini全版本价格汇总 2020-11-13
2021德云社封箱演出完整版 2021年德云社封箱演出在线看
2021德云社封箱演出完整版 2021年德云社封箱演出在线看 2021-03-15
返回顶部