(程序设计方法学.docxVIP

双人对弈算法：通过设置一个全局变量boolcolor，初始化为true，每一次落子就对color的值进行变换，通过color的值对子的颜色进行修改。代码中还包含了对落子的颜色记录到一个19*19的int型矩阵中以及对以落子的点的保护bool color = true;intpiece[19][19]={0};voidCWzqView::vDrawPiece(CPointpointBoard, intnType, CDC* pDC){CRgn rgnPiece;CPoint pointView = ptConvertBP2VP(pointBoard);rgnPiece.CreateEllipticRgn( pointView.x - WIDTH_Piece,pointView.y - WIDTH_Piece,pointView.x + WIDTH_Piece,pointView.y + WIDTH_Piece);CBrush brush;if (color == true){brush.CreateSolidBrush(COLOR_PieceBlack);piece[pointBoard.x][pointBoard.y] = 1;color = false;}else{brush.CreateSolidBrush(COLOR_PieceWhite);piece[pointBoard.x][pointBoard.y] = 2;color = true;}pDC-FillRgn(rgnPiece, brush);rgnPiece.DeleteObject();}// CWzqView::vDrawPiece判断输赢因为五子棋如果获胜，一定跟刚落的子有关。可根据这一原则对最近刚落下的子进行4个方向的循环扫描，如果有连成5个子就获胜，以横向为例进行了注释，其他三个方向的扫描只是对横向扫描的部分判断条件进行修改。//// draw piecept = pDoc-ptGetPiecePos();if ((pt.x = 0) ((pt.y = 0)) piece[pt.x][pt.y] == 0){vDrawPiece(pt, 0, pDC);//横向扫描int xx = pt.x, yy = pt.y;for (int i = 4;i 0;i--){if (--xx -1)//判断是否在最左边以右{if (piece[xx][yy] != piece[pt.x][pt.y])//判断左边的子是否颜色不同{xx = pt.x;yy = pt.y;for (int j = i;j 0;j--)//向右扫描，并将i的值赋给j{if (++xx 19)//判断是否在最右边以左{if (piece[xx][yy] != piece[pt.x][pt.y])//判断右边的子是否颜色不同{break;}}else //超过右边界的话直接结束循环{break;}if (j == 1 piece[xx][yy] == piece[pt.x][pt.y])//胜利情况之一：落子的右边有同颜色的子，总共连起来达到了5个{MessageBox(胜利, 提示!);break;}}break;//向右扫描结束，直接结束向左扫描}//左边的子如果与该子颜色相同就继续惊醒循环}else//如果该子已经在左边界上了，向右扫描，与前面的向右扫描一样{xx = pt.x;yy = pt.y;for (int j = i;j 0;j--){if (++xx 19){if (piece[xx][yy] != piece[pt.x][pt.y]){break;}}else{break;}if (j == 1 piece[xx][yy] == piece[pt.x][pt.y]){MessageBox(胜利, 提示!);break;}}break;}if (i == 1 piece[xx][yy] == piece[pt.x][pt.y])//胜利条件之一：向左扫描到四个一样颜色的子{MessageBox(胜利, 提示!);break;}}//纵向xx = pt.x;yy = pt.y;for (int i = 4;i 0;i--){if (--yy -1){if (piece[xx][yy] != piece[pt.x][pt.y]){xx = pt.x;yy = pt.y;for (int j = i;j 0;j--){if (++yy 19){if (piece[xx][yy] != piece[pt.x][pt.y]){break;}}else{break;}if (j == 1 piece[xx][yy] == piece[pt.x][pt.y