Scribd
Upload
42 views3 pages

Solve N-Queens Problem with Java

The document explains a Java program that solves the N-Queens problem using a backtracking algorithm, which involves placing N queens on an N×N chessboard without them threatening each other. It details the input and output requirements, the initialization of the board, the depth-first search (DFS) approach for exploring placements, and the validation process for safe queen positions. The program ultimately returns all valid configurations, demonstrating the effectiveness of backtracking in solving combinatorial problems.

Uploaded by

T Naresh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
42 views3 pages

Solve N-Queens Problem with Java

The document explains a Java program that solves the N-Queens problem using a backtracking algorithm, which involves placing N queens on an N×N chessboard without them threatening each other. It details the input and output requirements, the initialization of the board, the depth-first search (DFS) approach for exploring placements, and the validation process for safe queen positions. The program ultimately returns all valid configurations, demonstrating the effectiveness of backtracking in solving combinatorial problems.

Uploaded by

T Naresh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

N-Queens Problem Explanation

Introduction
This Java program solves the N-Queens problem using a backtracking algorithm. The N-
Queens problem asks: How can you place N queens on an N×N chessboard so that no two
queens threaten each other? In chess, a queen can move any number of squares
horizontally, vertically, or diagonally.

Problem Breakdown

Input:
An integer `n`, which represents the size of the chessboard (n x n) and the number of queens
to place.

Output:
All possible arrangements where `n` queens can be placed on the board without threatening
each other.

How Does the Program Work?

Initialize the Board:


A 2D character array (`board`) is created to represent the chessboard. Initially, every cell is
set to `'.'`, meaning it's empty.

Backtracking with DFS:


The main logic uses a depth-first search (DFS) algorithm to explore every possible way to
place the queens on the board. The function `dfs` tries to place a queen in each column, one
by one, checking every row in that column to see if placing a queen there is valid. If placing a
queen is valid, it moves to the next column and repeats the process until all columns are
filled. If an invalid placement is detected (i.e., queens threaten each other), the function
backtracks by removing the queen and tries another position.

Validation:
The `validate` function checks whether placing a queen at a specific position is safe: It
checks the current row on the left side, the upper diagonal on the left side, and the lower
diagonal on the left side. If no queen threatens the current position, the placement is valid.

Constructing Solutions:
When a valid configuration of queens is found, the `construct` function converts the board
into a list of strings representing the rows, which is then added to the result list.
Displaying the Results:
The main function `solveNQueens` returns all valid configurations. Each configuration is
printed as a separate arrangement.

Example: 4-Queens Problem


Let’s walk through the 4-Queens problem:

Step 1: Start with an empty 4x4 board.


....
....
....
....

Step 2: Place a queen in the first column and try to move to the next column.
1. Place a queen at `(0, 0)`:
Q...
....
....
....

2. Move to the next column and try each row to place a queen.

3. If a queen can be placed safely, move to the next column and repeat.

Step 3: If all queens are placed successfully, save this configuration.


One valid solution is:

.Q..
...Q
Q...
..Q.

This means queens are placed at positions `(0, 1)`, `(1, 3)`, `(2, 0)`, and `(3, 2)`.

Step 4: Continue exploring other configurations by backtracking.

Step 5: Output all possible solutions.


For `n = 4`, there are 2 possible solutions:

1.
.Q..
...Q
Q...
..Q.

2.
..Q.
Q...
...Q
.Q..

Conclusion
The program explores all possible ways to place N queens on an N×N board using recursion
and backtracking, ensuring that no two queens threaten each other. It outputs all valid
arrangements, demonstrating how backtracking is an effective way to solve combinatorial
problems like the N-Queens problem.

You might also like