【JAVA实例】五子棋小游戏

/*
    （1）绘制棋盘 - 写一个成员方法实现

    （2）提示黑方和白方分别下棋并重新绘制棋盘 - 写一个成员方法实现。

    （3）每当一方下棋后判断是否获胜 - 写一个成员方法实现。

    （4）提示： 采用二维数组来模拟并描述棋盘，棋盘如下：
 */

package stage1_module2.homework;

import java.util.Scanner;
import java.util.Arrays;

public class FiveInARowGame {

    // 1. 绘制一个五子棋棋盘
    public String[][] drawChessBoard(){

        String[][] chessBoard = new String[17][17];

        for(int i = 0; i < chessBoard.length; i++) {
            for(int j = 0; j < chessBoard.length; j++) {
                if(i == 0){
                    chessBoard[i][j] = "  "  + Long.toHexString(j-1) + "  ";
                } else if(j == 0){
                    chessBoard[i][j] = Long.toHexString(i-1);
                }
                else {
                    chessBoard[i][j] = "  +  ";
                }
                chessBoard[0][0] = " ";
                System.out.print(chessBoard[i][j] + " ");
            }
            System.out.println();
        }
        return chessBoard;

    }

    // 2. 提示黑方白方下棋
    public void playChess(){

        boolean flag = true;
        String side = "black";

        String[][] chessBoard = drawChessBoard();

        while ( flag ){

            System.out.println("请" + side + "落子(按照 行数 列数 的格式), eg: 7 8");
            System.out.println("PS：1 <= 行数 <= 16 / 1 <= 列数 <= 16 ");
            Scanner sc = new Scanner(System.in);

            int row = sc.nextInt();
            int column = sc.nextInt();

            if (chessBoard[row][column].equals("  +  ")) {
                chessBoard[row][column] = side;
                for (int i = 0; i < chessBoard.length; i++){
                    for (int j = 0; j < chessBoard[i].length; j++){
                        System.out.print
                                (chessBoard[i][j]);
                    }
                    System.out.println();
                }

                if (judge(chessBoard, side).equals(side + " Winning")){
                    System.out.println("恭喜" + side + "方赢得胜利");
                    flag = false;
                }else{
                    if (side.equals("black")){
                        side = " red ";
                    }else{
                        side = "black";
                    }
                }
            } else{
                System.out.println("请重新输入！");
            }

        }
    }

    // 3. 判断输赢
    public String judge(String[][] chessBoard, String side){

        // 1.判断横向是否连成五子
        for (int i = 1; i < chessBoard.length; i++) {
            int count = 0;
            for (int j = 1; j < chessBoard.length-1 ; j++) {
                boolean horizontal = chessBoard[i][j].equals(chessBoard[i][j + 1])
                        && chessBoard[i][j].equals(side);
                if ( horizontal ) {
                    count++;
                    if (count == 4) {
                        System.out.println(side + " Winning");
                        return side + " Winning";
                    }
                } else {
                    count = 0;
                }
            }
        }

        // 2.判断纵向是否连成五子
        for (int j = 1; j < chessBoard.length; j++) {
            int count = 0;
            for (int i = 1; i < chessBoard.length-1 ; i++) {
                // 2.判断纵向是否连成五子
                boolean vertical = chessBoard[i][j].equals(chessBoard[i + 1][j])
                        && chessBoard[i][j].equals(side);
                if ( vertical ) {
                    count++;
                    if (count == 4) {
                        System.out.println(side + " Winning");
                        return side + " Winning";
                    }
                } else {
                    count = 0;
                }
            }
        }

        // 3.判断对角线是否连成五子（左上↖️️到右下↘️️）
        int cnt_1 = 2*(chessBoard.length-1)-9;
        for (int k = 0; k < cnt_1; k++){
            int count = 0;
            for ( int i = ((k <= (cnt_1/2)) ? 1 : (k-10)) ;
            i < ( (k <= cnt_1/2) ? k-(cnt_1/2)+chessBoard.length : (cnt_1/2)-k+chessBoard.length) - 1 ;
                 i++){
                boolean diagLeftToRight =
                        chessBoard[i][chessBoard.length-k-6+i].equals(chessBoard[i+1][chessBoard.length-k-6+i+1])
                        && chessBoard[i][chessBoard.length-k-6+i].equals(side);
                if ( diagLeftToRight ) {
                    count++;
                    if (count == 4) {
                        System.out.println(side + " Winning");
                        return side + " Winning";
                    }
                } else {
                    count = 0;
                }

            }
        }

        // 4.判断对角线是否连成五子（右上↗️到左下↙️）
        int cnt_2 = 2*(chessBoard.length-1)-9;
        for (int k = 0; k < cnt_2; k++){
            int count = 0;
            for ( int i = ((k <= (cnt_2/2)) ? 1 : (k-10)) ;
                  i < ( (k <= cnt_2/2) ? k-(cnt_2/2)+chessBoard.length : (cnt_2/2)-k+chessBoard.length) - 1;
                  i++){
                boolean diagRightToLeft =
                        chessBoard[i][chessBoard.length+k-11-i].equals(chessBoard[i+1][chessBoard.length+k-11-i-1])
                                && chessBoard[i][chessBoard.length+k-11-i].equals(side);
                if ( diagRightToLeft ) {
                    count++;
//                    System.out.print("inner count :" + count + " ");
                    if (count == 4) {
                        System.out.println(side + " Winning");
                        return side + " Winning";
                    }
                } else {
                    count = 0;
//                    System.out.print("count:" + count + " ");
                }
            }
        }

        return "go on";
    }
}

package stage1_module2.homework;

public class FiveARowGameTest {

    public static void main(String[] args){

        FiveInARowGame f1 = new FiveInARowGame();
        f1.drawChessBoard();
        f1.playChess();
    }
}