基于C语言实现五子棋游戏完整实例代码

 /* * 使用键盘的上下左右键移动棋盘，空格键表示下棋，ESC键退出程序 */ #include  #include  #include  #include  #include /* * 对应键盘键的十六进制数字 */ #define ESC 0x11b #define UP 0x4800 #define DOWN 0x5000 #define LEFT 0x4b00 #define RIGHT 0x4d00 #define BLANK 0x3920 #define PLAYER1 1 #define PLAYER2 2 #define COMPUTER 2 #define LENGTH 15 #define SEARCH_DEEP 2 /* * 用来在函数can_expand()查找可以扩展的节点步长 */ #define STEP 1 /************全局变量定义***************/ int       x1 = 240, y1 = 240, oldx = 240, oldy = 240; int       key_mode; int       key_net; int       step_sum = 0; int       chessman[LENGTH][LENGTH]; int       depth = 2; /* 搜索的深度 */ int       a = 0, b = 0; int       flag_run; int       win_flag = 0; typedef struct five_chess *point; struct five_chess { int       x; int       y; int       layer; double     value; double     score; int       chess[LENGTH][LENGTH]; int       record[LENGTH][LENGTH]; } A; int       stack_deep0 = 0; point      stack_c[10]; point      close[600]; void push(point s0) { if (stack_deep0  0) return stack_c[stack_deep0 - 1]; /*else return 一个什么样的东西?*/ } void pop() { if (stack_deep0 > 0) stack_deep0--; } int is_empty() { if (stack_deep0 != 0) return 1; else return 0; } /************函数的声明**************/ void      five(); void      show(); int       win_or_not(int x0, int y0, int who, int chessman[LENGTH][LENGTH], int a); void      set_chessman(); void      print_result(); /************评价函数部分************/ double     score_row(int i, int j, int chessman[LENGTH][LENGTH]); double     score_col(int i, int j, int chessman[LENGTH][LENGTH]); double     score_diag_45(int i, int j, int chessman[LENGTH][LENGTH]); double     score_diag_135(int i, int j, int chessman[LENGTH][LENGTH]); double     total_score(int who_running, int chessman[LENGTH][LENGTH]); double     score(int chessman[LENGTH][LENGTH]); int       rowdt(int i, int j, int chessman[LENGTH][LENGTH]); int       coldt(int i, int j, int chessman[LENGTH][LENGTH]); int       diadt(int i, int j, int chessman[LENGTH][LENGTH]); int       vdiadt(int i, int j, int chessman[LENGTH][LENGTH]); int       can_expand(int i, int j, int chessman[LENGTH][LENGTH]); void     copy(point s1, point s0); int POW(int s, int t) { int       sum = s, i; if (t <= 0) return 1; for (i = 0; i <t; i++) sum *= sum; return sum; } /* * 定义computer先手 */ point expand(point s0) { int       flag; int       i, j; point      new_chess = (point) malloc(sizeof(struct five_chess)); /*************************这里出错***********************************/ for (i = 0; i <LENGTH; i++) for (j = 0; j chess[i][j] = s0->chess[i][j]; for (i = 0; i <LENGTH; i++) for (j = 0; j record[i][j] = s0->chess[i][j]; /*************************这里出错***********************************/ if (s0->layer % 2 == 0) flag = COMPUTER; else flag = PLAYER1; for (i = 0; i <LENGTH; i++) for (j = 0; j record[i][j])             /*如果有棋子*/ continue; if (can_expand(i, j, s0->chess) == 0)  /*如果有棋子，而且沿水平，树直，左上―右下，右上―左下，四个方向可以扩展*/ continue; s0->record[i][j] = flag; new_chess->chess[i][j] = flag; new_chess->layer = s0->layer + 1; new_chess->x = i; new_chess->y = j; new_chess->record[i][j] = flag; return new_chess; } /* * for(i=5;i<10;i++) for(j=5;jrecord[i][j]) continue; * if(can_expand(i,j,s0->chess)==0) continue; s0->record[i][j]=flag; * new_chess->x=i; new_chess->y=j; new_chess->record[i][j]=flag; * new_chess->layer=s0->layer+1; new_chess->chess[i][j]=flag ; return * new_chess; } for(i=2;i<12;i++) for(j=2;j4&&i4&&jrecord[i][j]) continue; * if(can_expand(i,j,s0->chess)==0) continue; s0->record[i][j]=flag; * new_chess->x=i; new_chess->y=j; new_chess->record[i][j]=flag; * new_chess->layer=s0->layer+1; new_chess->chess[i][j]=flag; return * new_chess; * * } for(i=0;i<LENGTH;i++) for(j=0;j1&&i1&&jrecord[i][j]) continue; * if(can_expand(i,j,s0->chess)==0) continue; s0->record[i][j]=flag; * new_chess->chess[i][j]=flag; new_chess->layer=s0->layer+1; * new_chess->x=i; new_chess->y=j; new_chess->record[i][j]=flag; return * new_chess; } */ new_chess->layer = -1; return new_chess; } void computer() { int       i, j, k, num = 0; int       break_now = 0; int       break_then = 0; int       go_on = 0; point     s0 = NULL, s1 = NULL, s2 = NULL, max_chess = NULL; point     temps = NULL, s01; /* * 堆栈的初始化 */ stack_deep0 = 0; s0 = malloc(sizeof(struct five_chess)); for (i = 0; i <600; i++)              /*为什么是600*/ close[i] = NULL;                 /*close是一个point 数组*/ close[num++] = s0; for (i = 0; i <LENGTH; i++) for (j = 0; j chess[i][j] = chessman[i][j]; s0->record[i][j] = chessman[i][j]; } s0->layer = 0; s0<em style="color:transparent">来源[email protected]搞@^&代*@码网</em>->value = -3000000; s0->score = -3000000; push(s0); while (is_empty() != 0) {        /*看是栈否为空*/ s01 = top();                  /*如果不是空*/ s1 = expand(s01);             /*从栈顶开始展开*/ close[num++] = s1; if (s1->layer == -1) { pop(); continue; } go_on = win_or_not((s1->x + 1) * 30, (s1->y + 1) * 30, 2, s1->chess, 1); if (go_on == 2) { a = (s1->x + 1) * 30; b = (s1->y + 1) * 30; break_then = 1; break; } go_on = win_or_not((s1->x + 1) * 30, (s1->y + 1) * 30, 1, s1->chess, 1); if (go_on == 1) { a = (s1->x + 1) * 30; b = (s1->y + 1) * 30; break_then = 1; break; } s1->value = 30000; push(s1); while (1) { s1 = top(); s2 = expand(s1); if (s2->layer == -1) { pop(); if (s1->value > top()->value) { top()->value = s1->value; max_chess = s1; } free(s2); break; }/*end of if*/ s2->score = score(s2->chess); temps = top(); if (s2->score value) temps->value = s2->score; free(s2); }/*end of whiile(1) */ } if (break_then == 0) { for (i = 0; i <LENGTH; i++) { for (j = 0; j chess[i][j] != chessman[i][j]) { a = i * 30 + 30; b = j * 30 + 30; break_now = 1; break; } if (break_now == 1) break; } } for (i = 0; i  30) { x1 -= 30; show();   /*显示方框*/ } break; case UP: if (y1 > 30) { y1 -= 30; show(); } break; case RIGHT: if (x1 <450) { x1 += 30; show(); } break; case DOWN: if (y1  30) { x1 -= 30; show(); } break; case UP: if (y1 > 30) { y1 -= 30; show(); } break; case RIGHT: if (x1 <450) { x1 += 30; show(); } break; case DOWN: if (y1 <450) { y1 += 30; show(); } break; case BLANK: { if (chessman[x1 / 30 - 1][y1 / 30 - 1]) break;                             /*有棋子了不走*/ setcolor(15); setfillstyle(SOLID_FILL, 15); /* 封闭图形，进行实体填充 */ circle(x1, y1, 10); floodfill(x1, y1, 15);               /*画棋子*/ chessman[x1 / 30 - 1][y1 / 30 - 1] = PLAYER1; flag_run = 1;                 /*有什么用?*/ step_sum++;                 /*下一步谁走*/ win_flag = win_or_not(x1, y1, 1, chessman, 0);  /*谁胜谁负*/ if (win_flag == 1) outtextxy(480, 240, "P1 Win"); else if (win_flag == 3) outtextxy(480, 240, "DOGFALL"); if (win_flag != 0) { while (bioskey(1) == 0);                 /*没有人胜则继续等待下棋*/ closegraph(); } } } /* switch */ } } computer();                      /*调用智能体*/ /* * a,b存放的是现在电脑准备下的位置 * 返回一个a,b的结构体不是更好，用全局变量不爽啊 * struct { *     int a; *     int b; * } */ setcolor(12); setfillstyle(SOLID_FILL, 12); circle(a, b, 10); floodfill(a, b, 12); chessman[a / 30 - 1][b / 30 - 1] = COMPUTER; flag_run = 0; step_sum++; win_flag = win_or_not(a, b, 2, chessman, 0); if (win_flag == 2) outtextxy(480, 240, "ComputerWin"); else if (win_flag == 3) outtextxy(480, 240, "DOGFALL"); if (win_flag != 0) { while (bioskey(1) == 0); closegraph(); } } } } void five() { int       i, j; /* * 画棋盘的过程 */ int       gdriver = DETECT, gmode; registerbgidriver(EGAVGA_driver); initgraph(&gdriver, &gmode, " "); /* * 对显示适配器进行配置 */ setbkcolor(1); for (i = 0; i = 2) ? 9 : i); rectangle(i, i, 479 - i, 479 - i); /* 画矩形边框 */ } /* * 画棋盘 */ for (i = 1; i <14; i++) for (j = 1; j <14; j++) { setcolor(14); line(30 + 30 * i, 30, 30 + 30 * i, 449); line(30, 30 + 30 * i, 449, 30 + 30 * i); } /* * 画整个图的边框 */ for (i = 0; i <15; i++) { setcolor(i); rectangle(i, i, 640 - i, 480 - i); line(480 - i, 15, 480 - i, 465); } /* * 输出屏幕右侧的信息 */ setcolor(4); settextstyle(0, 0, 2); outtextxy(500, 45, "GOBANG"); setcolor(10); settextstyle(0, 0, 1); outtextxy(500, 90, "Designed By"); outtextxy(514, 118, "Ye Binbin"); outtextxy(480, 140, "from class A of CS"); } /* * 移动光标 */ void show() { setcolor(1); if (oldx  30) line(oldx + 7, oldy - 15, oldx + 15, oldy - 15); if (oldy > 30) line(oldx + 15, oldy - 15, oldx + 15, oldy - 7); if (oldy <450) line(oldx + 15, oldy + 7, oldx + 15, oldy + 15); if (oldy  30) { if (oldy <450) line(oldx - 7, oldy + 15, oldx - 15, oldy + 15); if (oldy  30) line(oldx - 15, oldy - 7, oldx - 15, oldy - 15); if (oldy > 30) line(oldx - 15, oldy - 15, oldx - 7, oldy - 15); } setcolor(12); if (x1  30) line(x1 + 7, y1 - 15, x1 + 15, y1 - 15); if (y1 > 30) line(x1 + 15, y1 - 15, x1 + 15, y1 - 7); if (y1 <450) line(x1 + 15, y1 + 7, x1 + 15, y1 + 15); if (y1  30) { if (y1 <450) line(x1 - 7, y1 + 15, x1 - 15, y1 + 15); if (y1  30) line(x1 - 15, y1 - 7, x1 - 15, y1 - 15); if (y1 > 30) line(x1 - 15, y1 - 15, x1 - 7, y1 - 15); } oldx = x1; oldy = y1; } void set_chessman() { /* * 棋子有三种状态，0是未初始状态，1是控制方棋子，2是对方棋子 */ int       i, j; for (i = 0; i <15; i++) for (j = 0; j = 0 && line_sum != 4) { if (chessman[tmp_i--][j] == who_run) line_sum++; else break; } if (line_sum == 4) line_sum++; tmp_i = i; while (tmp_i = 0 && line_sum != 4) { if (chessman[i][tmp_j--] == who_run) line_sum++; else break; } if (line_sum == 4) line_sum++; tmp_j = j; while (tmp_j <= 15 && line_sum != 5) { if (chessman[i][tmp_j++] == who_run) line_sum++; else break; } if (line_sum == 5) { if (a == 1) chessman[i][j] = c; return who_run; } line_sum = -1; tmp_j = j; break; } while (1) {  /* 查找上对角线上是否连接了五个 */ while (line_sum != 4 && tmp_i = 0) { if (chessman[tmp_i++][tmp_j--] == who_run) line_sum++; else break; } tmp_i = i; tmp_j = j; if (line_sum == 4) line_sum++; while (line_sum != 5 && tmp_i >= 0 && tmp_j = 0 && tmp_j >= 0) { if (chessman[tmp_i--][tmp_j--] == who_run) line_sum++; else break; } tmp_i = i; tmp_j = j; if (line_sum == 4) line_sum++; while (line_sum != 5 && tmp_i <= 15 && tmp_j = 5) score = 200000; else { if (chessman[i][j] == 0) /* 没有下子,活的情况 */ score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; /* 死的情况 */ } } else { while (chessman[i][j] == who_running && j != LENGTH) { j++; sum_chessmen++; } mid_j = j; j = j - sum_chessmen - 1; while (chessman[i][j] == who_running && j != -1) { j--; sum_chessmen++; } if (j >= 0 && mid_j <LENGTH) { if (chessman[i][j] == 0 && chessman[i][mid_j] == 0) score = 18000 / POW(50, 4 - sum_chessmen); else if ((chessman[i][j] != 0 && chessman[i][mid_j] == 0) || (chessman[i][j] == 0 && chessman[i][mid_j] != 0)) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } if (j <0 && mid_j = 0 && mid_j >= LENGTH) { if (chessman[i][j] == 0) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } if (j = LENGTH) score = 0; } return score; } double score_col(int i, int j, int chessman[LENGTH][LENGTH]) { int       sum_chessmen = 0, mid_i; double     score = 0; int       who_running = chessman[i][j]; if (i == LENGTH) { while (chessman[i][j] == who_running) { i--; sum_chessmen++; } if (sum_chessmen >= 5) score = 200000; if (chessman[i][j] == 0) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } else { while (chessman[i][j] == who_running) { i++; sum_chessmen++; } mid_i = i; if (i == LENGTH || chessman[i][j] != who_running) { i = i - sum_chessmen; while (chessman[i - 1][j] == who_running) { i--; sum_chessmen++; } if (i >= 0) { if (chessman[i][j] == 0 && chessman[mid_i][j] == 0) score = 18000 / POW(50, 4 - sum_chessmen); else if ((chessman[i][j] != 0 && chessman[mid_i][j]) == 0 || (chessman[i][j] == 0 && chessman[mid_i][j] != 0)) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } if (i <0 && mid_i = 0 && mid_i >= LENGTH) { if (chessman[i][j] == 0) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } } } return score; } double score_diag_45(int i, int j, int chessman[LENGTH][LENGTH]) { int       sum_chessmen = 0; double     score = 0; int       mid_i, mid_j; int       who_running = chessman[i][j]; if (i == LENGTH || j == LENGTH) { while (chessman[i][j] == who_running && i > 1 && j > 1) { i--; j--; sum_chessmen++; } if (sum_chessmen >= 5) score = 200000; else { if (chessman[i][j] == 0) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } } else { while (chessman[i][j] == who_running && i <= LENGTH && j = 5) score = 200000; if (i >= 0 && j >= 0 && mid_i <length && mid_j = 0 && j >= 0) { if (chessman[i][j] == 0) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } else if (mid_i <length && mid_j = 5) score = 200000; else { if (i >= 0 && j = 0 && mid_i = 0 && j = 0 && mid_i <LENGTH) { if (chessman[mid_i][mid_j] == 0) score = 2000 / POW(10, 4 - sum_chessmen); else score = 0; } } } return score; } double total_score(int who_running, int chessman[LENGTH][LENGTH]) { /* * 统计出在该点上的得分,who_running=1表示人的棋子,2为电脑的棋子 */ int       i, j; double     score = 0; for (i = 0; i <LENGTH; i++) for (j = 0; j <LENGTH; j++) { if (chessman[i][j] == who_running) { score += score_row(i, j, chessman); score += score_col(i, j, chessman); score += score_diag_45(i, j, chessman); score += score_diag_135(i, j, chessman); } } return score; } double score(int chessman[LENGTH][LENGTH]) { /* * 计算最终的得分数,分别考虑了在这个位置放对方棋子跟自己棋子的综合 */ double     sum1, sum2; sum1 = total_score(COMPUTER, chessman); sum2 = total_score(PLAYER1, chessman); return sum1 - sum2; } /* * 扩展-----剪枝过程 */ int rowdt(int i, int j, int chessman[LENGTH][LENGTH])  /*在树直方向*/ { int       k; int       midjl = j - STEP,         /*当前棋子的上方*/ midjr = j + STEP + 1;     /*当前棋子的下方棋子的下方??????*/ if (midjl  LENGTH) midjr = LENGTH; for (k = midjl; k <midjr; k++)       /**/ if (chessman[i][k] != 0)         /*如果有棋子*/ return 1; return 0; } int coldt(int i, int j, int chessman[LENGTH][LENGTH])     /*水平方向*/ { int       k; int       midil = i + STEP + 1,         /*当前的右边棋子的右一个*/ midiu = i - STEP;            /*当前棋子的左一个*/ if (midiu  LENGTH) midil = LENGTH; for (k = midiu; k <midil; k++) if (chessman[k][j] != 0) return 1; return 0; } int diadt(int i, int j, int chessman[LENGTH][LENGTH])   /*右上到左下方向*/ { int       k, midi, midj; midi = i; midj = j; for (k = 0; k <STEP; k++) { midi++; midj--; if (midj = LENGTH) break; if (chessman[midi][midj] != 0) return 1; } for (k = 0; k <STEP; k++) { i--; j++; if (i = LENGTH) break; if (chessman[i][j] != 0) return 1; } return 0; } int vdiadt(int i, int j, int chessman[LENGTH][LENGTH])  /*左上到右下方向*/ { int       k, midi, midj; midi = i; midj = j; for (k = 0; k <STEP; k++) { midi--; midj--; if (midi <0 || midj = LENGTH || i >= LENGTH) break; if (chessman[i][j] != 0) return 1; } return 0; } int can_expand(int i, int j, int chessman[LENGTH][LENGTH]) { if (rowdt(i, j, chessman)) return 1; if (coldt(i, j, chessman)) return 1; if (diadt(i, j, chessman)) return 1; if (vdiadt(i, j, chessman)) return 1; /* * 如果不能扩展,返回0 */ return 0; } /************************************************************/