//判断能否连线
private static boolean canArrive(Point start, Point end, Chess[][] map){
if (start.x == end.x && start.y == end.y)
return true;
if (start.x == end.x){
int i = (end.y - start.y) > 0 ? 1 : -1;
for (int j = start.y + i; j > -1 && j < (Param.COL + 2) && j != end.y; j = j + i )
if (map[start.x][j].getStatus() != 0)
return false;
} else if (start.y == end.y){
int i = (end.x - start.x) > 0 ? 1 : -1;
for (int j = start.x + i; j > -1 && j < (Param.ROW +2) && j != end.x; j = j + i)
if (map[j][start.y].getStatus() != 0)
return false;
} else {
return false;
}
return true;
}