This article shares the specific code for implementing the 2048 mini game in C language for your reference. The specific content is as follows
It has the following characteristics:
Complete next
2. Non-blocking keyboard reading
3. Random generation of 2 and 4
#include <>
#include <>
#include <>
#define TTY_PATH "/dev/tty"
#define STTY_ON "stty raw -echo -F"
#define STTY_OFF "stty -raw echo -F"
int map[4][4];
typedef struct node
{
int x;
int y;
int num;
}Node;
Node node;
void init_map()//Initialize all squares{
int i, j;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
map[i][j] = 0;
}
void new_node()//Add a new square to avoid duplication.{
int x = 0, y = 0 ,num = 0;
do{
int fals = 1;
int i,j;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(map[i][j] == 0)
fals =0;
if(fals)//The new square cannot be filled in, the game fails {
system("clear");
printf("game over!!!!!!!!!!!\n");
exit(0);
}
x = rand() % 4;
y = rand() % 4;
num = rand() % 2;
if(num == 0)
num = 3;
else if(num == 1)
num = 5;
}while(map[x][y] > 0);
= x;
= y;
= num;
map[x][y] = ;
}
void show()//Color printing of numbers{
int i, j;
for(i=0; i<4; i++)
{
for(j=0; j<4; j++)
{
if(map[i][j]%2 == 1)
{
map[i][j] -= 1;
printf("\33[31m%d\33[0m\t",map[i][j]);
}
else if(map[i][j] == 0)
{
printf("%d\t",map[i][j]);
}
else if(map[i][j] == 2)
{
printf("\33[32m%d\33[0m\t",map[i][j]);
}
else if(map[i][j] == 4)
{
printf("\33[33m%d\33[0m\t",map[i][j]);
}
else if(map[i][j] == 8)
{
printf("\33[34m%d\33[0m\t",map[i][j]);
}
else if(map[i][j] == 16)
{
printf("\33[35m%d\33[0m\t",map[i][j]);
}
else if(map[i][j] == 32)
{
printf("\33[36m%d\33[0m\t",map[i][j]);
}
else
{
printf("\33[44m%d\33[0m\t",map[i][j]);
}
}
printf("\n");
}
}
void left()
{
int i, j, z, tmp;
for(i=0; i<4; i++)//The whole square moves left for(j=0; j<4; j++)
if(map[i][j] == 0 )
for(z = j + 1; z<4; z++)
if(map[i][z] > 0)
{
tmp = map[i][j];
map[i][j] = map[i][z];
map[i][z] = tmp;
break;
}
for(i=0; i<4; i++)//If the square numbers are the same, add them and call them multiple times through the main function, and arrange them well for(j=0; j<4; j++)
if(map[i][j] > 0 )
for(z = j + 1; z<4; z++)
if(map[i][z] > 0)
if(map[i][z] == map[i][j])
{
map[i][j] *= 2;
map[i][z] = 0;
}else
break;
else
break;
else
break;
}
void right()
{
int i, j, z, tmp;
for(i=0; i<4; i++)
for(j=3; j>=0; j--)
if(map[i][j] == 0 )
for(z = j-1; z>=0; z--)
if(map[i][z] > 0)
{
tmp = map[i][j];
map[i][j] = map[i][z];
map[i][z] = tmp;
break;
}
for(i=0; i<4; i++)
for(j=3; j>=0; j--)
if(map[i][j] > 0 )
for(z = j-1; z>=0; z--)
if(map[i][z] > 0)
if(map[i][z] == map[i][j])
{
map[i][j] *= 2;
map[i][z] = 0;
}else
break;
else
break;
else
break;
}
void up()
{
int i, j, z, tmp;
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(map[j][i] == 0 )
for(z = j+1; z<4; z++)
if(map[z][i] > 0)
{
tmp = map[j][i];
map[j][i] = map[z][i];
map[z][i] = tmp;
break;
}
for(i=0; i<4; i++)
for(j=0; j<4; j++)
if(map[j][i] > 0 )
for(z = j+1; z<4; z++)
if(map[z][i] > 0)
if(map[z][i] == map[j][i])
{
map[j][i] *= 2;
map[z][i] = 0;
}else
break;
else
break;
else
break;
}
void down()
{
int i, j, z, tmp;
for(i=0; i<4; i++)
for(j=3; j>=0; j--)
if(map[j][i] == 0 )
for(z = j-1; z>=0; z--)
if(map[z][i] > 0)
{
tmp = map[j][i];
map[j][i] = map[z][i];
map[z][i] = tmp;
break;
}
for(i=0; i<4; i++)
for(j=3; j>=0; j--)
if(map[j][i] > 0 )
for(z = j-1; z>=0; z--)
if(map[z][i] > 0)
if(map[z][i] == map[j][i])
{
map[j][i] *= 2;
map[z][i] = 0;
}else
break;
else
break;
else
break;
}
void move(char ch)
{
switch(ch)
{
case 'a':
left();
break;
case 'd':
right();
break;
case 'w':
up();
break;
case 's':
down();
break;
}
}
char in_direct()//Non-blocking input{
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()
{
srand(time(NULL));
init_map();
new_node();
show();
char ch;
int i=0;
while(1)
{
system(STTY_ON TTY_PATH);
ch = in_direct();
system(STTY_OFF TTY_PATH);
if(ch=='a'||ch=='d'||ch=='s'||ch=='w')
{
system("clear");
for(i=0;i<3;i++)//Repeat multiple times to sort well move(ch);
new_node();
show();
}
if(ch=='q')//Exit the game {
system("clear");
printf("game over!!!!!!!!\n");
break;
}
usleep(500000);
}
return 0;
}
The above is all the content of this article. I hope it will be helpful to everyone's study and I hope everyone will support me more.