Consider a Torus chessboard $\mathbb T$ of dimension $8\times8 $.
How much queens it is possible to put on in such a way that no one attacks another? (I assume we use the same rules of standard chess).
Obviously one can decide to use brute force but I 'm looking for a better solution. Thanks.
On $\mathbb T$ two or more queens attack the same number of squares, $28$ if I counted well, and I'm trying to say that $8$ queens attack more than $64- 7$ squares. (I'm assuming that it 's impossible to put eight queens).