Packing Centrosymmetric Patterns of n Nonattacking Queens on an n×n Board

DOI10.1007/978-3-540-77404-4_10zbMATH Open1154.05308OpenAlexW2171891114MaRDI QIDQ5448564FDOQ5448564

Authors: Herbert Taylor 

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77404-4_10

Recommendations

• The \(N\)-queens problem on a symmetric Toeplitz matrix
• Queens on non-square tori
• The number of \(n\)-queens configurations
• Nonattacking Queens on a Triangle
• The \(n\) queens problem with forbidden squares

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites Work

• Construction and properties of Costas arrays.
• Title not available (Why is that?)
• Gauss and the eight queens problem: A study in miniature of the propagation of historical error
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rook domains, Latin squares, affine planes, and error-distributing codes

Cited In (2)

• The \(N\)-queens problem on a symmetric Toeplitz matrix
• Centrosymmetric solutions to chessboard separation problems

This page was built for publication: Packing Centrosymmetric Patterns of n Nonattacking Queens on an n×n Board

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448564)