Scribd
Upload
111 views

8-Queen Problem

The 8-Queen problem aims to place 8 queens on a chessboard so that no two queens can attack each other. A backtracking algorithm is used, which tries placing queens in each column starting from the left. It checks if the current placement conflicts with any previously placed queens by being in the same row, column, or diagonal. If no conflicts exist, it recursively tries placing the remaining queens. If a conflict is found, it backtracks and tries a different placement. The algorithm returns true if all queens can be placed without conflicts, and false otherwise.

Uploaded by

Pratik Gandhi
Copyright
© Attribution Non-Commercial (BY-NC)
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
111 views

8-Queen Problem

The 8-Queen problem aims to place 8 queens on a chessboard so that no two queens can attack each other. A backtracking algorithm is used, which tries placing queens in each column starting from the left. It checks if the current placement conflicts with any previously placed queens by being in the same row, column, or diagonal. If no conflicts exist, it recursively tries placing the remaining queens. If a conflict is found, it backtracks and tries a different placement. The algorithm returns true if all queens can be placed without conflicts, and false otherwise.

Uploaded by

Pratik Gandhi
Copyright
© Attribution Non-Commercial (BY-NC)
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
You are on page 1/ 2

8-Queen problem ask us to set 8 queens on board such that they don't attack each other by any direction.

We must be knowing that queen can move row wise, column wise and in both diagonals also.

First thing we need here is, way to check whether we can put chosen queen at particular location or not. We can put queen only if satisfy following criteria. 1. It should be unique in its row. 2. It should be unique in its column. 3. It should be unique in its both diagonals.

Lets say we made some function called Check() which tell whether current queen have any conflicts with previous queens that we have set. Now we are ready to take up our back tracking algorithm. Following is simple algorithm for finding 8-Queen Problem. Step 1: If we have filled all rows of board than we are done. Step 2: Otherwise try all possible columns for current queen and check if it has any conflicts with any previous queen, if not then set remaining queens.

8 Queens Problem 8 Queen problem is a problem in which we have to place 8 Queens on 8x8 chessboard such that no two Queens attack each other.For placing the queens Backtrack Algorithm is used.Let us know first what is backtrack algorithm. Backtrack Algorithm : Backtrack algorithms uses a incremental technique to arrive at a final solution.It will take the candidate as valid and check all the constraints,if the solution is possible then it moves forward or else it will abandons it when it determines that solution is not possible taking the present candidate. How backtracking is helpful in the case of 8 Queens problem?? We will be going to place all the Queens in columns one by one from the leftmost column.When we will be placing the queens in the column we will check the constraints like if there is another queen in the row or column or diagonally.If we find a row that is valid and we can place a queen in that then we will take that row and column as a part of the solution.But if we cannot find such row and column then we backtrack and return false. Algorithm : 1) Start with the leftmost column 2) If all the queens are placed in right position return True. 3) Try out all the rows in the present column.If the queen can be safely placed in that row then mark this row and column as a part of the solution and recursively check that by placing the queen in that position will lead to the valid solution. 4) If placing queen in that particular row column results in a valid solution after applying recursion then return True 5) If placing queen in that particular row column does not lead to a valid solution then return False and check for next possibility. 6) If all the rows are tried for the present column and nothing worked then backtrack and return False.

You might also like