A chess board is an 8x8 matrix on which chess pieces are placed. A real chess...

 

Transcribed Image Text:

A chess board is an 8x8 matrix on which chess pieces are placed. A real chess game has a variety of pieces that have different rules defining how each can move and whom they can attack. For example, the queen can attack any other piece on the same row, column, or diagonal. Your program is to find solutions to the "Eight Queens Problem". Place eight queens on a standard chess board such that no queen can attack another. There are 92 unique solutions! 2.2. Notes . . Turn in only your source file: QueensPuzzleSolver.java. It will have an inner class which defines your implementation of PuzzleTest. Make sure your class is not in a package (that is, it is in the default package). Your output must include your name. Not that you would ever look to cheat, but there are many other solutions to this problem online that do not use this approach. Please don't try to turn in one of those! Hint: What is your Universe? The Queen positions 1-8. Generate all possible combinations of these positions and test each one. Each candidate represents the position of that queen on that row. Therefore, you don't have to worry about queens attacking on rows and columns, that's handled by the nature of your solution. You just need to check diagonals. Determining whether two queens can attach on the diagonal is simpler than you may think. Look at some examples by hand and see if you can determine the simple mathematical relationship. 2.3. Required Main Class QueensPuzzleSolver . You must use the PuzzleSolve class and PuzzleTest interface to solve this problem. Your solution must be recursive. 2.4. Required Input Not applicable 2.5. Required Output Your output should look like the following: Eight-Queens Puzzle - Your Name Solution #1 Q . Q A chess board is an 8x8 matrix on which chess pieces are placed. A real chess game has a variety of pieces that have different rules defining how each can move and whom they can attack. For example, the queen can attack any other piece on the same row, column, or diagonal. Your program is to find solutions to the "Eight Queens Problem". Place eight queens on a standard chess board such that no queen can attack another. There are 92 unique solutions! 2.2. Notes . . Turn in only your source file: QueensPuzzleSolver.java. It will have an inner class which defines your implementation of PuzzleTest. Make sure your class is not in a package (that is, it is in the default package). Your output must include your name. Not that you would ever look to cheat, but there are many other solutions to this problem online that do not use this approach. Please don't try to turn in one of those! Hint: What is your Universe? The Queen positions 1-8. Generate all possible combinations of these positions and test each one. Each candidate represents the position of that queen on that row. Therefore, you don't have to worry about queens attacking on rows and columns, that's handled by the nature of your solution. You just need to check diagonals. Determining whether two queens can attach on the diagonal is simpler than you may think. Look at some examples by hand and see if you can determine the simple mathematical relationship. 2.3. Required Main Class QueensPuzzleSolver . You must use the PuzzleSolve class and PuzzleTest interface to solve this problem. Your solution must be recursive. 2.4. Required Input Not applicable 2.5. Required Output Your output should look like the following: Eight-Queens Puzzle - Your Name Solution #1 Q . Q

Answer rating: 100% (QA)

The Eight Queens Problem is a classic example of the NQueens problem where the task is to place N queens on an NN chessboard in such a way that no two queens threaten each other Queens can attack in t... View the full answer