Abstract
SQ(n) is the maximum number of patterns that can sit on the n×n board where each pattern consists of n nonattacking Queens placed symmetrically around the center. Each square of the board has at most one Queen. Q(n) is the same except that “placed symmetrically around the center” is not required.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ginsburg, J.: Gauss’s arithmetization of the problem on n queens. Scripta math. 5, 63–66 (1939)
Campbell, P.J.: Gauss and the 8-queens problem: A study in miniature of the propagation of historical error. Historia mathematica 4, 397–404 (1977)
Golomb, S.W.: Sphere packing, coding metrics, and chess puzzles. In: Proceedings of the second Chapel Hill Conference on Combinatorial Mathematics and its Applications, U. No. Carolina at Chapel Hill, may (1970)
Golomb, S.W., Posner, E.C.: Rook domains, latin squares, affine planes, and errordistributing codes. IEEE Trans. Inform. Th. 10-3, 196–208 (1964)
Golomb, S.W., Taylor, H.: Constructions and properties of Costas arrays. IEEE Proc. 72, 1143–1163 (1984)
Etzion, T.: Combinatorial designs derived from Costas arrays. In: Sequences, Proceedings, Salerno, Italy (June 1989)
Taylor, H.: Singly periodic Costas arrays are equivalent to polygonal path Vatican squares. In: Mathematcial properties of sequences and other combinatorial structures, pp. 45–53. Kluwer Academic Publishers, Dordrecht (2003)
Kraitchik, M.: Mathematical Recreation (1944)
Golomb, S.W.: A mathematical theory of discrete classification. In: Proceedings of fourth London Symosium on Imformation Theory, pp. 404-425 (1959)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taylor, H. (2007). Packing Centrosymmetric Patterns of n Nonattacking Queens on an n×n Board. In: Golomb, S.W., Gong, G., Helleseth, T., Song, HY. (eds) Sequences, Subsequences, and Consequences. Lecture Notes in Computer Science, vol 4893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77404-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77404-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77403-7
Online ISBN: 978-3-540-77404-4
eBook Packages: Computer ScienceComputer Science (R0)