Queens on non-square tori
The electronic journal of combinatorics, Tome 8 (2001) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/1591
Classification : 05C69
Mots-clés : queens on a chessboard
@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/}
}
TY  - JOUR
AU  - Grant Cairns
TI  - Queens on non-square tori
JO  - The electronic journal of combinatorics
PY  - 2001
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1591/
DO  - 10.37236/1591
ID  - 10_37236_1591
ER  - 
%0 Journal Article
%A Grant Cairns
%T Queens on non-square tori
%J The electronic journal of combinatorics
%D 2001
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1591/
%R 10.37236/1591
%F 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 :