2048(游戏)

玩法:

即模仿市场上的2048游戏。


效果图:

这里写图片描述
这里写图片描述
这里写图片描述


实现原理:

  • 就当是一个非常复杂的模拟题,整理好思路,搭好大体结构不难写。
  • 重点是如何判断方块是否合并那里,还有检测是否游戏结束。
  • 分数用一个全局变量储存,每次更新出性方块时加分。
  • 为方块分数加了个等比例增加的#号,要不玩起来难受的要死。
    -

源代码:

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
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<conio.h>

int a[4][4], SCORE = 0, prt;

int num()
{
return rand()%4;
}

int scan()
{
int i, j, t = 0;
for(i = 0; i < 4; i++)
{
for(j = 0; j < 4; j++)
{
if (a[i][j] == 0)
{
return 1;
}
}

}
return 0;
}

void crt()
{
SCORE += 2;
int i,j;
for(;1;)
{
i = num();
j = num();
printf("%d %d", i, j);
if (a[i][j] == 0)
{
a[i][j] = 2;
break;
}
}
}

void frmt()
{
int i, d;
for (i = 0; i < 4; i++)
{
for (d = 0; d < 4; d++)
{
a[i][d] = 0;
}
}
}

void put()
{
int i,d;
printf("\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\tScode: \t%d\n\n\t\t\t┌──────┬──────┬──────┬──────┐\n\t\t\t", SCORE);
for (i = 0; i < 4; i++)
{

for (d = 0; d < 4; d++)
{
if (a[i][d] == 2048)
printf("│##########%d ", a[i][d]);
else if (a[i][d] == 1024)
printf("│#########%2d ", a[i][d]);
else if (a[i][d] == 512)
printf("│########%3d ", a[i][d]);
else if (a[i][d] == 256)
printf("│#######%4d ", a[i][d]);
else if (a[i][d] == 128)
printf("│######%5d ", a[i][d]);
else if (a[i][d] == 64)
printf("│#####%6d ", a[i][d]);
else if (a[i][d] == 32)
printf("│####%7d ", a[i][d]);
else if (a[i][d] == 16)
printf("│###%8d ", a[i][d]);
else if (a[i][d] == 8)
printf("│##%9d ", a[i][d]);
else if (a[i][d] == 4)
printf("│#%10d ", a[i][d]);
else if (a[i][d] == 2)
printf("│%11d ", a[i][d]);
else
printf("│ ", a[i][d]);
}
printf("│");

if (i != 3)
{
printf("\n\t\t\t├──────┼──────┼──────┼──────┤\n\t\t\t");
}
}
printf("\n\t\t\t└──────┴──────┴──────┴──────┘\n\n\n");
}


void A_()
{
int i, j, t;
for (i = 0; i < 4; i++)
{
for (j = 0; j < 4; j++)
{
if (a[i][j] == 0)
continue;
else
{
for (t = j + 1; t < 4; t++)
{
if (t != 0 && a[i][t] == a[i][j])
{
prt=1;
a[i][j] *= 2;
a[i][t] = 0;
}
else if (t != 0 && a[i][t] != a[i][j])
break;
}
}
}
}

for (i = 0; i < 4; i++)
{
for (j = 0; j < 4; j++)
{
if (a[i][j] == 0)
{
for (t = j + 1; t < 4; t++)
{
if (a[i][t] != 0)
{
prt=1;
a[i][j] = a[i][t];
a[i][t] = 0;
break;
}
}
}
}
}
}

void D_()
{
int i, j, t;
for (i = 0; i < 4; i++)
{
for (j = 3; j >= 0; j--)
{
if (a[i][j] == 0)
continue;
else
{
for (t = j - 1; t >= 0; t--)
{
if (t != 0 && a[i][t] == a[i][j])
{
prt=1;
a[i][j] *= 2;
a[i][t] = 0;
}
else if (t != 0 && a[i][t] != a[i][j])
break;
}
}
}
}

for (i = 0; i < 4; i++)
{
for (j = 3; j >= 0; j--)
{
if (a[i][j] == 0)
{
for (t = j - 1; t >= 0; t--)
{
if (a[i][t] != 0)
{
prt=1;
a[i][j] = a[i][t];
a[i][t] = 0;
break;
}
}
}
}
}
}

void S_()
{
int i, j, t;
for (i = 0; i < 4; i++)
{
for (j = 3; j >= 0; j--)
{
if (a[j][i] == 0)
continue;
else
{
for (t = j - 1; t >= 0; t--)
{
if (t != 0 && a[j][i] == a[t][i])
{
prt=1;
a[j][i] *= 2;
a[t][i] = 0;
}
else if (t != 0 && a[t][i] != a[j][i])
break;
}
}
}
}

for (i = 0; i < 4; i++)
{
for (j = 3; j >= 0; j--)
{
if (a[j][i] == 0)
{
for (t = j - 1; t >= 0; t--)
{
if (a[t][i] != 0)
{
prt=1;
a[j][i] = a[t][i];
a[t][i] = 0;
break;
}
}
}
}
}
}

void W_()
{
int i, j, t;
for (i = 0; i < 4; i++)
{
for (j = 0; j < 4; j++)
{
if (a[j][i] == 0)
continue;
else
{
for (t = j + 1; t < 4; t++)
{
if (t != 0 && a[j][i] == a[t][i])
{
prt=1;
a[j][i] *= 2;
a[t][i] = 0;
}
else if (t != 0 && a[t][i] != a[j][i])
break;
}
}
}
}

for (i = 0; i < 4; i++)
{
for (j = 0; j < 4; j++)
{
if (a[j][i] == 0)
{
for (t = j + 1; t < 4; t++)
{
if (a[t][i] != 0)
{
prt=1;
a[j][i] = a[t][i];
a[t][i] = 0;
break;
}
}
}
}
}
}

int main()
{
int judge;
char ch;
srand((unsigned) time(NULL));

printf("\n\n\n\n\n\n\t\t\tW S A D Control direction\n\n\n\n\t\t\tPress any key to start the game...\n");
getch();

frmt();
crt();
put();

for (;1;)
{
prt = 0;
for (;1;)
{
printf("\n\n\n\n\n\n\n\nPlease enter: ");
ch = getch();
putchar(ch);
if(ch >= 'a' && ch <= 'z')
ch -= 32;
if(ch == 'W' || ch == 'A' || ch == 'D' || ch == 'S')
break;
}

if (ch == 'A')
A_();

if (ch == 'D')
D_();

if (ch == 'S')
S_();

if (ch == 'W')
W_();

if (scan())
{
if (prt)
crt();
put();
}
else
{
printf("\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\t\t\t\tGame Over\n\n\n\n\n\n\n\n\n\n\n\n\n\n");
break;
}
}
getchar();
}

PS:

印象中好像是十月一刚开学时,非常无聊写的,当作是锻炼代码能力了,也是图个好玩,成就感也是有的,毕竟是第一个有点可玩性的游戏,有时候真的停不下来233。