On the existence of reflecting <i>n</i>-queens configurations

Abstract In 1967, Klarner proposed a problem concerning the existence of reflecting n -queens configurations. The problem considers the feasibility of placing n mutually nonattacking queens on the reflecting chessboard , an $n\times n$ chessboard with a $1\times n$ “reflecting strip” of squares added along one side of the board. A queen placed on the reflecting chessboard can attack the squares in the same row, column, and diagonal, with the additional feature that its diagonal path can be reflected via the reflecting strip. Klarner noted the equivalence of this problem to a number theory problem proposed by Slater, which asks: for which n is it possible to pair up the integers 1 through n with the integers $n+1$ through $2n$ such that no two of the sums or differences of the n pairs of integers are the same. We prove the existence of reflecting n -queens configurations for all sufficiently large n , thereby resolving both Slater’s and Klarner’s questions for all but a finite number of integers.