OFFSET
1,10
COMMENTS
A superqueen moves like a queen and a knight.
A linear-time algorithm giving an explicit solution for any n >= 10 for the n-super-queens-problem can be found at the link. Included is an online solver, implemented in JavaScript. - Frank Schwellinger (nummer_eins(AT)web.de), Mar 19 2004. [But see the next comment - N. J. A. Sloane, Jul 01 2021]
Escamocher and O'Sullivan (2021) claim Schwellinger's algorithm is incorrect, and that their own algorithm is the first published linear-time algorithm. - N. J. A. Sloane, Jul 01 2021
LINKS
D. Bill, Durango Bill's The N-Queens Problem
Guillaume Escamocher and Barry O'Sullivan, Leprechauns on the chessboard, Discrete Mathematics, 344(5), 2021. See especially page 3.
Vaclav Kotesovec, Non-attacking chess pieces, 6ed.
R. Oprisch, N x N SuperQueens Solutions Table
F. Schwellinger, Explicit Solution To the N-Super-Queens Problem.
W. Schubert, N-Queens page
CROSSREFS
KEYWORD
nonn,nice,more
AUTHOR
Ulrich Schimke (ulrschimke(AT)aol.com)
EXTENSIONS
a(20) from Bill link added Jul 25 2006
a(21)-a(23) from R. Oprisch's website added by Max Alekseyev, Sep 29 2006
a(24)-a(26) from W. Schubert, Jul 31 2009, Nov 29 2009, Jan 18 2011
STATUS
approved