在java中用递归构建一个简单的棋盘

public class Chessboard {
    private static final int SIZE = 8; // 棋盘大小

    public static void main(String[] args) {
        char[][] board = new char[SIZE][SIZE]; // 创建一个二维数组表示棋盘

        // 初始化棋盘
        for (int i = 0; i < SIZE; i++) {
            for (int j = 0; j < SIZE; j++) {
                board[i][j] = '-';
            }
        }

        // 构建棋盘
        buildChessboard(board, 0, 0, SIZE);

        // 打印棋盘
        for (int i = 0; i < SIZE; i++) {
            for (int j = 0; j < SIZE; j++) {
                System.out.print(board[i][j] + " ");
            }
            System.out.println();
        }
    }

    // 递归构建棋盘
    private static void buildChessboard(char[][] board, int row, int col, int size) {
        if (size == 1) {
            board[row][col] = 'X'; // 棋盘中只剩下一个格子，放置棋子
            return;
        }

        int halfSize = size / 2;

        // 递归构建四个子棋盘
        buildChessboard(board, row, col, halfSize);
        buildChessboard(board, row, col + halfSize, halfSize);
        buildChessboard(board, row + halfSize, col, halfSize);
        buildChessboard(board, row + halfSize, col + halfSize, halfSize);
    }
}