References
- [BS09] J. Bell, B. Stevens, A survey of known results and research areas for n-queens, Discrete Math. 309 (1), 1–31, 2009.
- [Bro19] T. M. Brown, The problem of pawns, Electron. J. Combin. 26(3), Paper No. 3.21, 9pp, 2019.
- [Fri22] E. Friedman, Problem of the Month (February 2001), Math Magic. https://erich-friedman.github.io/mathmagic/0201.html Accessed January 2022.
- [Gar01] M. Gardner, Some New Results on Nonattacking Chess Tasks, Math Horizons, 8(3), 10-–12, 2001. http://www.jstor.org/stable/25678300
- [Jel05] G. Jelliss, Chess-Piece Arrangement Problems Part 4: Multiple Un-guard Arrangements, The Games and Puzzles Journal, 39(May-June 2005). https://www.mayhematics.com/a/arrangements4.htm
- [Joh18] K. Johnson, On the Domination Chain of m by n Chess Graphs, Murray State Theses and Dissertations, 97, 2018. https://digitalcommons.murraystate.edu/etd/97
- [NSB07] N. Nethercote, P.J. Stuckey, R. Becket, S. Brand, G.J. Duck, G. Tack, MiniZ-inc: Towards a standard CP modelling language, in: C. Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Pro-gramming, volume 4741 of LNCS Springer, 529–543, 2007.
- [Pis21] D. Pisa, personal communication, December 2021.
- [SFS14] P.J. Stuckey, T. Feydy, A. Schutt, G. Tack, J. Fischer, The MiniZinc challenge 2008-2013, AI Magazine, 35(2), 55–60, 2014.
- [Wat04] J.J. Watkins, Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, 2004.