What is the Maximum Number of Equivalence Classes for the Eight Queens Problem?

  • MHB
  • Thread starter Ackbach
  • Start date
  • Tags
    2015
In summary, The Eight Queens Problem is a classic puzzle that involves placing eight queens on a standard 8x8 chessboard in such a way that no queen can attack any other queen. There are 92 unique solutions to this problem, and the maximum number of equivalence classes is 12. The maximum number of equivalence classes is determined by considering the different ways the first three queens can be placed on the chessboard. The problem can be solved using a backtracking algorithm without using brute force.
  • #1
Ackbach
Gold Member
MHB
4,155
92
Here is this week's POTW:

-----

The statement of the Eight Queens Problem is to place eight queens on a regular chessboard so that no two queens are attacking each other. For anyone ignorant of the rules of chess, queens attack in any direction vertically or horizontally or in either $45^{\circ}$ diagonal. (We will ignore the $n$-Queen problem on an $n\times n$ chessboard.) If you examine the wikipedia page portion on the Solutions, it claims that there are 12 fundamental solutions to the problem. These fundamental solutions form other solutions by rotations and reflections only. Suppose we allow translations as well, so that two solutions are considered the "same" (in the same equivalence class), if one solution can be obtained from the other by a combination of translations, rotations, and reflections. Moreover, we will allow solutions to "wrap-around" the edges of the board. Provide an upper bound, smaller than $12$, on the number of such equivalence classes.

-----

Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
  • #2
Honorable mention goes to Opalg, with an upper bound of 11. Here is my solution:

I claim the upper bound is no more than 6. Solutions 1, 2, 3, 4, 6, 8, 10 are all obtained from the following by rotations, reflections, or translations:

View attachment 4463

Notice this is a bigger chessboard than usual - it's to illustrate the pattern before it wraps around. Also notice that this isn't technically a solution, as there are two queens attacking each other. Wrap-around solves this issue: where this pattern is the basis of the solution, the pattern wraps around in such a way that the problem resolves.

I have not yet seen any definite pattern in the remaining solutions: 5, 7, 9, 11, and 12. If anyone else sees a pattern there, I'd be thrilled to know about it. It's certainly not clear that any of these solutions can be obtained from the above.
 

Attachments

  • Chessboard for Eight Queens Problem - Copy.gif
    Chessboard for Eight Queens Problem - Copy.gif
    11 KB · Views: 102

FAQ: What is the Maximum Number of Equivalence Classes for the Eight Queens Problem?

What is the Eight Queens Problem?

The Eight Queens Problem is a classic puzzle that involves placing eight queens on a standard 8x8 chessboard in such a way that no queen can attack any other queen. This means that no two queens can be on the same row, column, or diagonal.

How many solutions are there to the Eight Queens Problem?

There are a total of 92 unique solutions to the Eight Queens Problem. This number was first calculated by mathematician Max Bezzel in 1863. However, this only includes solutions that are unique under rotations and reflections. If all possible permutations are considered, the number of solutions increases to 12,312.

What is the maximum number of equivalence classes for the Eight Queens Problem?

The maximum number of equivalence classes for the Eight Queens Problem is 12. This means that there are 12 distinct patterns that all other solutions can be categorized into. These equivalence classes are determined by the positions of the queens on the first three rows of the chessboard.

How is the maximum number of equivalence classes determined?

To determine the maximum number of equivalence classes for the Eight Queens Problem, we can use a combinatorial approach. By considering the different ways that the first three queens can be placed on the chessboard, we can see that there are 3! = 6 possible combinations. Each of these combinations can then be rotated and reflected to create the 12 distinct equivalence classes.

Is there a way to solve the Eight Queens Problem without using brute force?

Yes, the Eight Queens Problem can be solved using a backtracking algorithm. This approach involves systematically placing queens on the chessboard and checking if their positions are valid. If a queen is placed in a position that would result in an attack, it is moved to a different position. This process is repeated until a solution is found or all possible combinations have been exhausted.

Similar threads

Replies
1
Views
2K
Replies
1
Views
1K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
1
Views
1K
Replies
1
Views
2K
Back
Top