《JAVA课程设计-五子棋游戏》.docVIP

package chess_game; import java.awt.Color; import java.io.Serializable; public class Point implements Serializable{ private int x; private int y; private Color color; public Point(){} public Point(int x,int y,Color color){ this.x = x; this.y = y; this.color = color; } public int getX(){ return x; } public int getY(){ return y; } public Color getColor(){ return color; } } package chess_game; public class IsWin { public static boolean winLR(int x,int y){ //判断左右方向是否存在连续五子 int countnum=0;//用来记录一方连续棋子个数 boolean flag = false; for(int i=y;i=0;i--){ //先向左找 if(ChessBoard.board[x][i]==ChessBoard.board[x][y]) countnum++; else break; } for(int i=y+1;iChessBoard.board[0].length;i++){ //再向右找 if(ChessBoard.board[x][i]==ChessBoard.board[x][y]) countnum++; else break; } if(countnum=5){ flag=true; //左右方向存在连续五子 } return flag; //flag为true时，表示已判断出输赢 } public static boolean winUD(int x,int y){ //判断上下方向是否存在连续五子 int countnum=0; boolean flag = false; for(int i=x;i=0;i--){ //先向上找 if(ChessBoard.board[i][y]==ChessBoard.board[x][y]) countnum++; else break; } for(int i=x+1;iChessBoard.board.length;i++){ // 再向下找 if(ChessBoard.board[i][y]==ChessBoard.board[x][y]) countnum++; else break; } if(countnum=5){ flag=true; //上下方向存在连续五子 } return flag; } public static boolean winRD(int x,int y){ //判断右对角线是否存在连续五子 int countnum=0; boolean flag = false; for(int i=x,j=y;i=0j=0;i--,j--){ //先向左上方向寻找 if(ChessBoard.board[i][j]==ChessBoard.board[x][y]) countnum++; else break; } for(int i=x+1,j=y+1;iChessBoard.board.lengthjChessBoard.board[0].length;i++,j++){ //再向右下方向寻找 if(ChessBoard.board[i][j]==ChessBoard.board[x][y]) countnum++; else break; } if(countnum=5){ flag=true; //右对角线方向存在连续五子 } return