Breaking News: Grepper is joining You.com. Read the official announcement!

backtracking algorithm for the n_queens problem

Uma Naga Vara Prasad Reddy Karri answered on November 1, 2023 Popularity 5/10 Helpfulness 1/10

answer backtracking algorithm for the n_queens problem

backtracking algorithm for the n_queens problem

Comment

public class NQueens2DArray {
    public static void main(String[] args) {
        placeQueens(4);
    }

    public static void placeQueens(int gridSize) {
        if (gridSize < 4) {
            System.out.println("No Solution available");
        } else {
            int[][] board = new int[gridSize][gridSize];
            placeAllQueens(board, 0);
            printBoard(board);
        }
    }

    private static boolean placeAllQueens(int board[][], int row) {
        if (row >= board.length) {
            return true;
        }
        boolean isAllQueensPlaced = false;
        for (int j = 0; j < board.length; j++) {
            if (isSafe(board, row, j)) {
                board[row][j] = 1;
                isAllQueensPlaced = placeAllQueens(board, row + 1);
            }
            if (isAllQueensPlaced) {
                break;
            } else {
                board[row][j] = 0;
            }
        }
        return isAllQueensPlaced;
    }

    private static boolean isSafe(int board[][], int row, int col) {
        for (int i = row - 1, j = col + 1; i >= 0 && j < board.length; i--, j--) {
            if (board[i][j] == 1) {
                return false;
            }
        }
        for (int i = row - 1; i >= 0; i--) {
            if (board[i][col] == 1) {
                return false;
            }
        }
        return true;
    }

    private static void printBoard(int[][] board) {
        for (int row = 0; row < board.length; row++) {
            for (int col = 0; col < board.length; col++) {
                if (board[row][col] == 1) {
                    System.out.print("Q ");
                } else {
                    System.out.print("_ ");
                }
            }
            System.out.println();
        }
        System.out.println();
    }
}

Popularity 5/10 Helpfulness 1/10 Language typescript

Source: chat.openai.com

Tags: algorithm backtracking typescript

Link to this answer
Share Copy Link

Contributed on Nov 01 2023

Uma Naga Vara Prasad Reddy Karri

0 Answers Avg Quality 2/10

backtracking algorithm for the n_queens problem

Contents

More Related Answers

backtracking algorithm for the n_queens problem

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.