if (count >= 5)
flag = true;
}
}
}
return flag;
}
// 判断棋子连接的数量
private int checkCount(int xChange, int yChange, int color) {
int count = 1;
int tempX = xChange; // x临时变量
int tempY = yChange; // y临时变量
while (color == allChess[x + xChange][y + yChange]) {
count++;
if (xChange != 0)
xChange++;
if (yChange != 0)
if (yChange > 0)
yChange++;
else
yChange--;
}
xChange = tempX;
yChange = tempY;
while (color == allChess[x - xChange][y - yChange]) {
count++;
if (xChange != 0)
xChange++;
if (yChange != 0)
if (yChange > 0)
yChange++;
else
yChange--;
}
return count;
}