[seqfan] Re: Nonattacking queens on a quarter-board

Bob Selcoe rselcoe at entouchonline.net
Thu Jul 14 19:53:36 CEST 2016

Hi Seqfans,

I wrote:

>>>I think probably the number of allowable queens (q) is< n-1, and that as 
increases, n-q increases.  If so, is there a definable limit?

To answer my own question, I conjecture 2n/3 + 1 as n -> inf., which is half 
the maximum number of queens possible on half of a chessboard (symmetric 
about its diagonal, making a k x k right triangle).  This quarter-board is 
just half of that right triangle symmetric about its main diagonal.

Is this reasonable enough to post as a comment on A274933??

Bob S.

From: "Neil Sloane" <njasloane at gmail.com>
Sent: Wednesday, July 13, 2016 11:20 AM
To: "Sequence Fanatics Discussion list" <seqfan at list.seqfan.eu>
Subject: [seqfan] Nonattacking queens on a quarter-board

> Dear Seqfans,  I keep running across questions about placing queens on an
> infinite chess-board so that they don't attack each other.
> Here is one version.
> Take the quarter-board formed from a k X k chess board
> by joining the center square (k is odd) to the top two corners.
> If k = 21 the board looks like this:
> -----OOOOOOOOOOO-----
> ------OOOOOOOOO------
> -------OOOOOOO-------
> --------OOOOO--------
> ---------OOO---------
> ----------O----------
> Gmail is distorting the board, but the top row is the top edge of the
> board, with 21 squares, and the bottom row contains the single square at
> the center of the board.
> There are 11*11 = 121 squares.
> The problem is to place non-attacking queens on this board. I suspect the
> max number is n-1, if there are n rows (and n^2 squares), and this can be
> attained for all n > 2. (But I don't know if that is really true)
> Here is a construction (I think) for the above board (X = queen):
> -----OOOOOOOOOXO-----
> ------OOXOOOOOO------
> -------OOOOXOO-------
> --------OXOOO--------
> ---------OOO---------
> ----------X----------
> What it would be nice to have is a construction for the infinite board - 
> in
> other words, nested solutions for all n.  So that the solution for n-1 
> rows
> is obtained by dropping the top row of the solution for n rows.  Is it
> possible?
> In the above picture the queens are in lines a knight's move apart
> This kind of question comes up in studying infinite Sudoku-like arrays 
> like
> A269526 or Zak's spiral, A274640.
> --
> Seqfan Mailing list - http://list.seqfan.eu/

More information about the SeqFan mailing list