Queens on non-square tori
The electronic journal of combinatorics, Tome 8 (2001) no. 1
We prove that for $m < n$, the maximum number of nonattacking queens that can be placed on the $n\times m$ rectangular toroidal chessboard is $\gcd(m,n)$, except in the case $m=3, n=6$.
@article{10_37236_1591,
author = {Grant Cairns},
title = {Queens on non-square tori},
journal = {The electronic journal of combinatorics},
year = {2001},
volume = {8},
number = {1},
doi = {10.37236/1591},
zbl = {0977.05098},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1591/}
}
Grant Cairns. Queens on non-square tori. The electronic journal of combinatorics, Tome 8 (2001) no. 1. doi: 10.37236/1591
Cité par Sources :