REFERENCES
- W. Ahrens, Mathematische Unterhaltungen und Spiele, Vol. 1, B. G. Teubner, Leipzig 1921.
- J. D. Beasly, The Mathematics of Games, Oxford University Press, Oxford 1990.
- Berliner Schachgesellschaft, 3 (1848), p. 363.
- S. Chowla, I. N. Herstein, and K. Moore, On recursions connected with symmetric groups I, Canadian J. of Math. 3 (1951), 328–334.
- D. Clark, A combinatorial theorem on circulant matrices, This Monthly 92 (1985), 725–729.
- B.-J. Falkowski and L. Schmitz, A note on the queen's problem, I.P.L. (= Information Processing Letters) 23 (1986), 39–46.
- L. R. Foulds and D. G. Johnston, An application of Graph Theory and Integer Programming: Chessboard non-attacking puzzles, Math. Gazette 57 (1984), 95–104.
- M. Gardner, The unexpected Hanging and other Mathematical Diversions, Simon and Schuster, New York 1986.
- C. F. Gauss, Letters to H. C. Schumacher, September 12–27, 1850, Werke, Vol. 12, Springer, Berlin 1929, p. 20–28.
- Dr. J. W. L. Glaisher, Philosophical Magazine, 18 (1874), 457–467.
- S. Golomb and L. Baumert, Backtrack programming, J.A.C.M. 12 (1965), 516–524.
- R. Haralick and G. Elliott, increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence 14 (1980), 263–313.
- G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford 1988.
- E. J. Hoffman, J. C. Loessi, and R. C. Moore, Construction for the solution of the n-queens problem, Math. Mag. 42 (1969), 66–72.
- M. Kraitchik, Mathematical Recreations, Dover, New York 1953.
- L. Larson, A theorem about primes proved on a Chessboard, Math. Mag. 50 (1977), 69–74.
- E. Lucas, Récréations Mathématiques, Vol. I, Albert Blanchard, Paris 1977.
- E. Lucas, Théorie des Nombres, Albert Blanchard, Paris 1961.
- P. Monsky, Problem E 2698, This Monthly 85 (1978), p. 116.
- P. Monsky, Problem E 3162, This Monthly 93 (1986), p. 566.
- L. Moser and M. Wyman, On the solution of xd = 1 in symmetric groups, Canadian J. of Math. 7 (1955), 159–168.
- F. Nauck, Illustrierten Zeitung, 14, p. 352, June 1, 1850; 15, p. 182, September 21, 1850; 15, p. 207, Semptember 28, 1850.
- M. Reichling, A Simplified Solution of the N Queens' Problem, I.P.L. 25 (1987), 253–255.
- I. Rivin and R. Zabih, An Algebraic Approach to Constraint Satisfaction Problems, Proceedings of the Int. Joint Conf. on A.I., Detroit 1989.
- I. Rivin and R. Zabih, A dynamic programming solution to the N-queens problem, I.P.L. 41 (1992), 253–256.
- R. W. Robinson, Counting the arrangements of Bishops, in “Combinatorial Mathematics IV, Adelaide 1975,” L. Notes in Math. 560 (1976), Springer-Verlag 1976, 198–214.
- W. W. Rouse Ball and H. S. M. Coxeter, Mathematical Recreations and Essays, Dover 1987.
- A. Sainte-Laguë, Les Réseaux (ou Graphes), Mém. Des Sc. Math. 18, Ghautier-Villars, Paris 1926.
- A. Shapira, Personal communication, August 1992.
- R. P. Stanley, Combinatorics and Commutative Algebra, Birkhäuser 1983.
- R. P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth 1986.
- H. S. Stone and J. M. Stone, Efficient Search Techniques-An Empirical study of the N-Queens Problem, IBM Technical Report, T. J. Watson Research Center.
- I. Vardi, Computational Recreations in Mathematica, Addison Wesley 1990.
- A. M. Yaglom and I. M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, Vol. I, Dover 1987.
- R. Zabih, Personal communication 1988.