查找正方形二维数组中任何随机点的对角线

Question

我必须编写设置8x8矩阵的代码，一个棋盘，然后询问用户他们想要将女王放在哪一行和哪一列上。然后，我必须在女王可以移动到的每个方块上放一个*。在女王可以移动到的行和列上放一个 * 并不困难，但我无法正确标记女王可以移动到的对角线。这是我到目前为止编写的代码，用于尝试定位对角线：

    char[][] chessboard = new char[8][8];
            System.out.print("What row do you want to place the queen on? ");
            int row = console.nextInt();
            System.out.print("What column do you want to place the queen on? ");
            int column = console.nextInt();
            char queen = 'Q';
            chessboard[row - 1][column - 1] = queen;
            // column and rows
            for (int i = 0; i < chessboard.length; i++) {
                for (int j = 0; j < chessboard[0].length; j++) {
                    if ((i == 2 || j == 6) && chessboard[i][j] != queen) {
                        chessboard[i][j] = '*';
                    }
                }
            }
            if ((row - 1) != 0) {
                // left diagonal
                for (int i = 0; i < row; i++) {
                    for (int j = (column - 1 - (row - 1)); ((column - 1) - (row - 1)) <= j && j < column; j++) {
                        if (chessboard[i][j] != queen) {
                            chessboard[i][j] = '*';
                        }
                    }
                }
                for (int i = (row - 1) + (8 - (column)); i >= row - 1; i--) {
                    for (int j = 7; j >= (column - 1); j--) {
                        if (chessboard[i][j] != queen) {
                            chessboard[i][j] = '*';
                        }
                    }
                }
                // right diagonal
                for (int i = 7; i >= row - 1; i--) {
                    for (int j = (column - 1 - (row - 1)); 0 <= j && j < column; j--) {
                        if (chessboard[i][j] != queen) {
                            chessboard[i][j] = '*';
                        }
                    }
                }
            }
 for (int i = 0; i < chessboard.length; i++) {
            for (int j = 0; j < chessboard[0].length; j++) {
                System.out.print(chessboard[i][j] + " ");
            }
            System.out.println();
        }
    }

当我输入实验值时，例如第 3 行和第 7 列，我得到的输出非常混乱。对于上面的数字，我得到：

[][][][] * * * [] 
[][][][] * * * [] 
* * * *  * * Q  * 
* * * * * [] *  * 
* * * * * [] * [] 
* * * * * [] * [] 
* * * * * [] * [] 
* * * * * [] * []

有人可以告诉我哪里出错了吗？*这是一个家庭作业问题，所以请只在答案中编码。谢谢！

Answer 1

如果是我，我会简单地循环棋盘的每个方块，并测试每个方格的有效性，作为女王可以移动到的三个可能的规则，即

square.x == queen.x ||
square.y == queen.y ||
|square.x - queen.x| == |square.y - queen.y|

如果您的正方形

符合上述任何规则，那么它是一个有效的正方形，否则不是。 当然，省略女王目前居住的广场

square.x != queen.x && square.y != queen.y

伪代码：

for (int i = 0; i < chessboard.length; i++) {
    for (int j = 0; j < chessboard[0].length; j++) {
        // You could encapsulate these lines in a isValidSquareForQueenMove(x, y) method.
        boolean isSquareValid = false;
        isSquareValid = isSquareValid || x == queen.x;
        isSquareValid = isSquareValid || y == queen.y;
        isSquareValid = isSquareValid || Math.abs(queen.x - x) == Math.abs(queen.y - y);
        isSquareValid = isSquareValid && x != queen.x && y != queen.y;
        // Do stuff here.
    }
}