该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
void draw_one(int y, int x)
{
int i, m, k, j;
char c[4] = {*0*, *0*, *0*, *0*};
i = a[y][x];
m = 0;
do {
j = i % 10;
c[m++] = j + *0*;
i = i / 10;
}while(i > 0);
m = 0;
k = (x + 1) * 5 - 1;
while(c[m] != *0*) {
move(2*y+1, k);
addch(c[m++]);
k--;
}
}
void play()
{
int x, y, i, new_x, new_y, tmp;
char ch;
while(1) {
draw();
ch = getch();
switch(ch) {
case *A*:
case *a*:
//从左向右消去相同方块
for(y = 0; y < 4; y++)
for(x = 0; x < 4; ) {
if(a[y][x] == 0) {
x++;
continue;
} else {
for(i = x + 1; i < 4; i++) {
if(a[y][i] == 0) {
continue;
}
else {
if(a[y][x] == a[y][i]) {
a[y][x] += a[y][i];
a[y][i] = 0;
x = i + 1;
empty++;
break;
}
else {
x = i;
break;
}
}
}
x = i;
}
}
//向左移动方块
for(y = 0; y < 4; y++)
for(x = 0; x < 4; x++) {
if(a[y][x] == 0) {
continue;
} else {
for(i = x; (i > 0) && (a[y][i-1] == 0); i--) {
a[y][i-1] = a[y][i];
a[y][i] = 0;
}
}
}
break;
case *D*:
case *d*:
//从右向左消去相同方块
for(y = 0; y < 4; y++)
for(x = 3; x >= 0; ) {
if(a[y][x] == 0) {
x--;
continue;
} else {
for(i = x - 1; i >= 0; i--) {
if(a[y][i] == 0) {
continue;
} else if(a[y][x] == a[y][i]) {
a[y][x] += a[y][i];
a[y][i] = 0;
x = i - 1;
empty++;
break;
} else {
x = i;
break;
}
}
x = i;
}
}
//向右移动方块
for(y = 0; y < 4; y++)
for(x = 3; x >= 0; x--) {
if(a[y][x] == 0) {
continue;
} else {
for(i = x; (i < 3) && (a[y][i+1] == 0); i++) {
a[y][i+1] = a[y][i];
a[y][i] = 0;
}
}
}
break;
case *W*:
case *w*:
//从上向下消去相同方块
for(x = 0; x < 4; x++)
for(y = 0; y < 4; ) {
if(a[y][x] == 0) {
y++;
continue;
} else {
for(i = y + 1; i < 4; i++) {
if(a[i][x] == 0) {
continue;
} else if(a[y][x] == a[i][x]) {
a[y][x] += a[i][x];
a[i][x] = 0;
y = i + 1;
empty++;
break;
} else {
y = i;
break;
}
}
y = i;
}
}
//向上移动方块
for(x = 0; x < 4; x++)
for(y = 0; y < 4; y++) {
if(a[y][x] == 0) {
continue;
} else {
for(i = y; (i > 0) && (a[i-1][x] == 0); i--) {
a[i-1][x] = a[i][x];
a[i][x] = 0;
}
}
}
break;
case *S*:
case *s*:
//从下向上消去相同方块
for(x = 0; x < 4; x++)
for(y = 3; y >= 0; ) {
if(a[y][x] == 0) {
y--;
continue;
} else {
for(i = y - 1; i >= 0; i--) {
if(a[i][x] == 0) {
continue;
} else if(a[y][x] == a[i][x]) {
a[y][x] += a[i][x];
a[i][x] = 0;
y = i -1;
empty++;
break;
} else {
y = i;
break;
}
}
y = i;
}
}
//向下移动方块
for(x = 0; x < 4; x++)
for(y = 3; y >= 0; y--) {
if(a[y][x] == 0) {
continue;
} else {
for(i = y; (i < 3) && (a[i+1][x] == 0); i++) {
a[i+1][x] = a[i][x];
a[i][x] = 0;
}
}
}
break;
case *Q*:
case *q*:
game_over();
break;
default:
continue;
break;
}
if(empty <= 0)
game_over();
draw();
//生成新方块
do {
new_x = rand() % 4;
new_y = rand() % 4;
}while(a[new_y][new_x] != 0);
cnt_value(&new_y, &new_x);
do {
tmp = rand() % 4;
}while(tmp == 0 || tmp == 2);
a[new_y][new_x] = tmp + 1;
empty--;
draw_one(new_y, new_x);
}
}
int cnt_one(int y, int x)
{
int value = 1;
if(y - 1 > 0)
a[y-1][x] ? 0 : value++;
if(y + 1 < 4)
a[y+1][x] ? 0 : value++;
if(x - 1 >= 0)
a[y][x-1] ? 0 : value++;
if(x + 1 < 4)
a[y][x+1] ? 0 : value++;
if(y - 1 >= 0 && x - 1 >= 0)
a[y-1][x-1] ? 0 : value++;
if(y - 1 >= 0 && x + 1 < 4)
a[y-1][x+1] ? 0 : value++;
if(y + 1 < 4 && x - 1 >= 0)
a[y+1][x-1] ? 0 : value++;
if(y + 1 < 4 && x + 1 < 4)
a[y+1][x+1] ? 0 : value++;
return value;
}
void cnt_value(int *new_y, int *new_x)
{
int max_x, max_y, x, y, value;
int max = 0;
max = cnt_one(*new_y, *new_x);
for(y = 0; y < 4; y++)
for(x = 0; x < 4; x++) {
if(!a[y][x]) {
value = cnt_one(y, x);
if(value > max && old_y != y && old_x != x) { //避免在同一位置反复出现新方块
*new_y = y;
*new_x = x;
break;
}
}
}
}
int game_over()
{
sleep(1);
endwin();
exit(0);
}