English

The N-queens Problem on a symmetric Toeplitz matrix

Combinatorics 2010-08-02 v1

Abstract

We consider the problem of placing nn nonattacking queens on a symmetric n×nn \times n Toeplitz matrix. As in the NN-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 nn nonattacking queens can be placed on such a matrix if and only if n0,1mod4n\equiv 0,1 \mod 4.

Cite

@article{arxiv.1007.5350,
  title  = {The N-queens Problem on a symmetric Toeplitz matrix},
  author = {Zsuzsanna Szaniszlo and Maggy Tomova and Cindy Wyels},
  journal= {arXiv preprint arXiv:1007.5350},
  year   = {2010}
}

Comments

7 pages, 4 figures

R2 v1 2026-06-21T15:54:57.029Z