Linux下的C之2048
2016-03-26 00:05
309 查看
#include <stdio.h> #include <stdlib.h> #include <curses.h> #include <time.h> #include <unistd.h> #include <signal.h> // 4*4方格 int a[4][4] = {0}; // 方格里空格的个数 int empty; int old_y, old_x; void draw(); void play(); void init(); void draw_one(int y, int x); void cnt_value(int *new_y, int *new_x); int game_over(); int cnt_one(int y, int x); int main() { init(); play(); endwin(); return 0; } void init() { int x, y; initscr(); cbreak(); noecho(); curs_set(0); empty = 15; srand(time(0)); x = rand() % 4; y = rand() % 4; a[y][x] = 2; draw(); } void draw() { int n, m, x, y; char c[4] = {'0', '0', '0', '0'}; clear(); for(n = 0; n < 9; n += 2) //横线 for(m = 0; m < 21; m++) { move(n, m); addch('-'); refresh(); } for(m = 0; m < 22; m += 5) //竖线 for(n = 1; n < 8; n++) { move(n, m); addch('|'); refresh(); } for(y = 0; y < 4; y++) //数字 for(x = 0; x < 4; x++) { draw_one(y, x); } } 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; int old_empty, move; char ch; while(1) { move = 0; old_empty = empty; //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; move = 1; } } } 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; move = 1; } } } 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; move = 1; } } } 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; move = 1; } } } break; case 'Q': case 'q': game_over(); break; default: continue; break; } if(empty <= 0) game_over(); draw(); //生成新方块 if((empty != old_empty) || (move == 1)) { //修复了不移动或消除方块也生成新方块的bug 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; old_x = x; old_y = y; break; } } } } int game_over() { sleep(1); endwin(); exit(0); }
vim game_2048.c,按下i进入编辑模式,然后将上面的代码复制进去,再按Esc退出编辑模式,按下:x保存并退出。
然后在终端运行:gcc game_2048.c -o 2048 -lcurses 进行编译,最后输入./2048即可运行2048。方向键是wasd。
效果截图:
![](https://images2017.cnblogs.com/blog/787014/201711/787014-20171106161040559-179945922.png)
相关文章推荐
- 树莓派忘记密码
- 更改linux主机名称
- linux安装jdk
- CentOS安装Node.js
- 在ubunt14.04(linux)下利用cmake编译运行opencv程序
- CentOS源码安装MySQL教程
- Linux内核分析第五周学习总结——分析system_call中断处理过程
- 《LINUX3.0内核源代码分析》第二章:中断和异常 【转】
- linux下mysql查询时中文乱码(终极解决办法)亲测!
- linux中断系统那些事之----中断处理过程【转】
- linux,ubuntu下软件的更新命令
- Linux下给树莓派安装及配置系统
- Linux USB 驱动开发实例(一) —— USB摄像头驱动实现源码分析
- Linux下的目录结构
- SecureCRT连不上Linux虚拟机的一种可能
- Centos7.1防火墙开放端口
- Linux中mv重命名作用及打包war压缩文件及分配权限
- linux :make: gcc: Command not found
- 编译linux内核遇到的问题
- Linux学习笔记<三>