On the existence of reflecting n-queens configurations

Dai, Tantan  ; Kelly, Tom 

Forum of Mathematics, Sigma, Tome 13 (2025) no. 1, p. e169

Résumé

In 1967, Klarner proposed a problem concerning the existence of reflecting n-queens configurations. The problem considers the feasibility of placing n mutually nonattacking queens on the reflecting chessboard, an $n\times n$ chessboard with a $1\times n$ “reflecting strip” of squares added along one side of the board. A queen placed on the reflecting chessboard can attack the squares in the same row, column, and diagonal, with the additional feature that its diagonal path can be reflected via the reflecting strip. Klarner noted the equivalence of this problem to a number theory problem proposed by Slater, which asks: for which n is it possible to pair up the integers 1 through n with the integers $n+1$ through $2n$ such that no two of the sums or differences of the n pairs of integers are the same. We prove the existence of reflecting n-queens configurations for all sufficiently large n, thereby resolving both Slater’s and Klarner’s questions for all but a finite number of integers.

Détail

DOI : 10.1017/fms.2025.10097

Bibliographie

[1] Bell, J. and Stevens, B., ‘A survey of known results and research areas for n-queens’, Discrete Math. 309 (2009), 1–31. doi:https://doi.org/10.1016/j.disc.2007.12.043 Google Scholar | DOI

[2] Bowtell, C. and Keevash, P., ‘The n-queens problem’, Preprint (2021), . https://doi.org/10.48550/arXiv.2109.08083 Google Scholar | arXiv | DOI

[3] Glock, S., Munhá Correia, D. and Sudakov, B., ‘The n-queens completion problem’, Res. Math. Sci. 9 (2022), Paper No. 41, 20. https://doi.org/10.1007/s40687-022-00335-1 Google Scholar PubMed | DOI

[4] Guy, R. K., Unsolved Problems in Number Theory, third ed., Problem Books in Mathematics, Springer, New York, 2004. https://doi.org/10.1007/978-0-387-26677-0 Google Scholar | DOI

[5] Huff, G. B., ‘On pairings of the first 2n natural numbers’, Acta Arith. 23 (1973), 117–126. https://doi.org/10.4064/aa-23-2-117-126 Google Scholar | DOI

[6] Janson, S., Łuczak, T. and Ruciński, A., Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York, 2000. https://doi.org/10.1002/9781118032718 Google Scholar

[7] Klarner, D. A., ‘The problem of reflecting queens’, Amer. Math. Monthly 74 (1967), 953–955. https://doi.org/10.2307/2315273 Google Scholar

[8] Luria, Z., ‘New bounds on the number of n-queens configurations’, Preprint (2017), . https://doi.org/10.48550/arXiv.1705.05225 Google Scholar | arXiv | DOI

[9] Luria, Z. and Simkin, M., ‘A lower bound for the n-queens problem’, in Proc. 2022 ACM–SIAM Symp. Discrete Algorithms (SODA), SIAM, 2022, 2185–2197. https://doi.org/10.1137/1.9781611977073.86 Google Scholar

[10] Pauls, E., ‘Das Maximalproblem der Damen auf dem Schachbrete’, Dtsch. Schachzeitung 29 (1874), 129–134. Google Scholar

[11] Pauls, E., ‘Das Maximalproblem der Damen auf dem Schachbrete, II’, Dtsch. Schachzeitung 29 (1874), 257–267. Google Scholar

[12] Pólya, G., ‘Über die doppelt-periodischen’ Losüngen des n-Damen-Problems’, Math. Unterhaltungen Spiele 2 (1918), 364–374. Google Scholar

[13] Rivin, I., Vardi, I. and Zimmermann, P., ‘The n-queens problem’, Amer. Math. Monthly 101 (1994), 629–639. https://doi.org/10.1080/00029890.1994.11997004 Google Scholar | DOI

[14] Sebastian, J. D., ‘Some computer solutions to the reflecting queens problem’, Amer. Math. Monthly 76 (1969), 399–400. https://doi.org/10.1080/00029890.1969.12000226 Google Scholar | DOI

[15] Shen, M. K. and Shen, T. P., ‘Problem 39’, Bull. Amer. Math. Soc. 68 (1962), 557. https://doi.org/10.1090/S0002-9904-1962-10842-8 Google Scholar

[16] Simkin, M., ‘The number of n-queens configurations’, Adv. Math. 427 (2023), Paper No. 109127, 83. https://doi.org/10.1016/j.aim.2023.109127 Google Scholar | DOI

[17] Slater, M., ‘Problem 1’, Bull. Amer. Math. Soc. 69 (1963), 333. https://doi.org/10.1090/S0002-9904-1963-10907-6 Google Scholar