2048
来源：互联网 发布：信贷数据分析 编辑：程序博客网 时间：2024/05/12 19:22
代码
/************************************** wsad控制上下左右，q退出* 编译命令 gcc 2048.c -lcurses* 需要下载ncurses库，具体方法请百度**************************************/#include <stdio.h>#include <curses.h>#include <sys/time.h>#include <signal.h>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 set_ticker();void sig_alrm(int sig);int a[4][4] = {0};int flag, empty;int old_y, old_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 sig_alrm(int sig){ set_ticker(500); flag = 1;}void draw(){ int n, m, x, y, i, j, k, t, h; 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++, t++) //数字 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; 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);}int set_ticker(int n_msec){ struct itimerval timeset; long n_sec, n_usec; n_sec = n_msec / 1000; n_usec = (n_msec % 1000) * 1000L; timeset.it_interval.tv_sec = n_sec; timeset.it_interval.tv_usec = n_usec; timeset.it_value.tv_sec = n_sec; timeset.it_value.tv_usec = n_usec; return setitimer(ITIMER_REAL, ×et, NULL);}结果
视频
c语言小游戏
0 0
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- 2048
- RFC 2048
- zoj 2048
- hdu 2048
- Android StatusBar
- Android:JNI函数编码风格（C风格与C++风格）
- BlockingQueue解析
- Android Studio1.5 编译优化
- 前端开发面试总结其他部分
- 2048
- 面向对象 六大设计原则
- zzulioj 1825: 会长爱数学 （求循环节）
- 容器学习笔记
- OpenOffice菜单方块乱码问题
- Innodb IO优化－配置优化
- Centos6.X安装单机Hadoop2.6
- c语言学习笔记之内存分区
- mac eclipse快捷键整理
