Queens on Non-square Tori

Abstract

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$.