- #1
Ackbach
Gold Member
MHB
- 4,155
- 93
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!
-----
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!