REFERENCES
- D. Archdeacon, Private communication, 2010.
- N. Alon, Combinatorial Nullstellensatz. Recent trends in combinatorics (Matrahaza, 1995), Combin. Probab. Comput. 8 (1999) 7–29.
- N. Alon, Z. Füredi, Covering the cube by affine hyperplanes. European J. Combin. 14 (1993) 79–83.
- A. Burger, C. Mynhardt, An improved upper bound for queens domination numbers, The 18th British Combinatorial Conference (Brighton, 2001). Discrete Math. 266 (2003) 119–131.
- A. Cooper, O. Pikhurko, J. Schmitt, G. Warrington, Martin Gardner's minimum no-3-in-a-line problem. (2012), available at http://arxiv.org/abs/1206.5350.
- H. Fernau, Minimum dominating set of queens: a trivial programming exercise? Discrete Appl. Math. 158 (2010)308–318.
- M. Gardner, Papers 1957-1986 (Box 37, Folders 12 and 13, and Box 40, Folder 4). Special Collections and University Archives, Stanford University, Stanford, CA.
- M. Gardner, Penrose Tiles to Trapdoor Ciphers…And the Return of Dr. Matrix. Revised edition. The Mathematical Association of America, Washington, DC, 1997.
- M. Gardner, Martin Gardner's Mathematical Games. MAA Spectrum, Mathematical Association of America, Washington, DC, 2005.
- R. Guy, P. Kelly, The no-three-in-line problem, Canad. Math. Bull. 11 (1968) 527–531.
- J. Harris, Private communication to Martin Gardner, Jun 7, 1975. M. Gardner Papers 1957-1986. Special Collections and University Archives, Stanford University, Stanford, CA.
- D. Hilbert, Ueber die vollen Invariantensysteme, Math. Ann. 42 (1893) 313–373.
- N. Sloane, The on-line encyclopedia of integer sequences, available at http://oeis.org/.
- T. Tao, V. Vu, Additive Combinatorics. Cambridge University Press, Cambridge, 2010.
- J. Watkins, Across the Board: The Mathematics of Chessboard Problems. Princeton University Press, Princeton, NJ, 2004.