How many mutually non-attacking, non-knight pieces can we place on an m × n chessboard?
By: Doug Chatham
References
- [BS09] J. Bell, B. Stevens, A survey of known results and research areas for n-queens, Discrete Math. 309(1) (2009), 1–31.
- [Cha24] D. Chatham, Arrangements of mutually non-attacking chess pieces of mixed type, Recreational Mathematics Magazine 11(18) (2024), 1–16.
- [Fri22] E. Friedman, Problem of the Month (February 2001), Math Magic, available at 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) (2001), 10–12, available at http://www.jstor.org/stable/25678300.
- [NSB+07] N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck, and G. Tack, MiniZinc: Towards a standard CP modelling language, in: C. Bessiere (ed.), Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, LNCS 4741, Springer, 2007, 529–543.
- [SFS+14] P. J. Stuckey, T. Feydy, A. Schutt, G. Tack, and J. Fischer, The MiniZinc challenge 2008–2013, AI Magazine 35(2) (2014), 55–60.
DOI: https://doi.org/10.2478/rmm-2026-0002 | Journal eISSN: 2182-1976
Language: English
Page range: 21 - 30
Published on: May 27, 2026
Published by: Ludus Association
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Related subjects:
© 2026 Doug Chatham, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.