pith. sign in

arxiv: 1007.5350 · v1 · pith:HEZCU6FCnew · submitted 2010-07-29 · 🧮 math.CO

The N-queens Problem on a symmetric Toeplitz matrix

classification 🧮 math.CO
keywords queensmatrixproblemattacknonattackingothersymmetrictoeplitz
0
0 comments X
read the original abstract

We consider the problem of placing $n$ nonattacking queens on a symmetric $n \times n$ Toeplitz matrix. As in the $N$-queens Problem on a chessboard, two queens may attack each other if they share a row or a column in the matrix. However, the usual diagonal restriction is replaced by specifying that queens may attack other queens that occupy squares with the same number value in the matrix. We will show that $n$ nonattacking queens can be placed on such a matrix if and only if $n\equiv 0,1 \mod 4$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.