Abstract
The problem of the bishops is to determine the number of arrangements of n bishops on an n × n chessboard such that no bishop threatens another and every unoccupied square is threatened by at least one bishop. Two arrangements are considered equivalent if they are isomorphic by way of one of the eight symmetries of the chessboard. The total number of inequivalent solutions to the problem of the bishops is found, as well as the numbers of solutions which have each of the possible automorphism groups. The values up to n=16 are tabulated, and asymptotic formulas are found. A review of analogous results for the problem of the rooks is included, since they are made use of in studying the problem of the bishops.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.A. Bender, Asymptotic methods in enumeration, SIAM Review 16(1974), 485–515.
W. Burnside, Theory of Groups of Finite Order. (Second edition, Cambridge University Press, London, 1911; reprinted by Dover, New York, 1955.)
S. Chowla, I.N. Herstein and K. Moore, On recursions connected with symmetric groups I, Canadian J. Math. 3 (1951), 328–334.
F. Harary and E.M. Palmer, Graphical Enumeration. (Academic Press, New York, 1973.)
W.K. Hayman, A generalisation of Stirling’s formula, J. Reine Angew. Math. 196 (1956), 67–95.
M. Kraitchik, Mathematical Recreations. (Second revised edition, W.W. Norton, New York, 1942; reprinted by Dover, New York, 1953.)
E. Lucas, Théorie des Nombres, V.T. (Gauthier-Villars, Paris, 1891; reprinted by Albert Blanchard, Paris, 1961.)
L. Moser and M. Wyman, On the solution of Xd=1 in symmetric groups, Canadian J. Math. 7 (1955), 159–168.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Robinson, R.W. (1976). Counting arrangements of bishops. In: Casse, L.R.A., Wallis, W.D. (eds) Combinatorial Mathematics IV. Lecture Notes in Mathematics, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097382
Download citation
DOI: https://doi.org/10.1007/BFb0097382
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08053-4
Online ISBN: 978-3-540-37537-1
eBook Packages: Springer Book Archive
