Re: Finding just one solution to N-queen problem by observing the pattern of solutions

HKLN wrote: 
Did anyone do this before? That is, just input the N and the solution
is constructed by just putting the queens on the board directly. This
takes linear time.

Recently, I found the pattern for all N except N = 9, 15, 21, ...,
9+6n.
Although I haven't proved the solution mathematically, I tested my
method for N below 1000.

To avoid reinventing the wheel, I would like to know if anyone did this
before.

Thank you for your time.

A few years ago, a friend told me it was published but I haven't the reference.
.

Relevant Pages