USE JAVA

The 8-queens problem is a problem of placing n queens on an n n chessboard, where solutions. The question of the problem is how to place eight queens on a chessboard in a way that they are not able to attack each other. There should not be any 2 queens in the same horizontal, vertical or diagonal line. The goal is not just to find one possible solution, but all of them. An advanced way of looking at the problem is by trying to solve the problem for any number of queens. The number of queens can be defined in the source code and the amount of horizontal and vertical lines of the board are defined according to the number of queens. The one solution is given in the following figure.

The idea is to place queens one by one in different columns, starting from the leftmost column. When we place a queen in a column, there should not be two queens in same rows or columns or diagonals. If we find a row for which there is no repeating queue, we mark this row and column as part of the solution. If we do not find such a row due to attack, then we backtrack.

METHOD: Recursion & Backtracking.

Output: You should display at least three visual outputs similar to the above figure.