Metric spaces in chess and international chess pieces graph diameters

Marco Ripà

doi:10.2478/rmm-2026-0003

.blurhash-client-img { display: none !important; }

Metric spaces in chess and international chess pieces graph diameters

Recreational Mathematics Magazine

Volume 13 (2026): Issue 22 (June 2026)

By: Marco Ripà

Open Access

|May 2026

[AGA91] AGA Rules Committee, Official AGA rules of Go, 1991, available at https://www.cs.cmu.edu/~wjh/go/rules/AGA.html.
Search in Google Scholar Back to article
[And23] T. Andrews, Queen’s graph diameter and knight’s graph diameter for a n × n × · · ·×n chessboard, preprint (Mathematics Stack Exchange version: 2023-05-22), 2023, available at https://math.stackexchange.com/q/4619848.
Search in Google Scholar Back to article
[BYZ+10] S. Bai, X.-F. Yang, G.-B. Zhu, D.-L. Jiang, and J. Huang, Generalized knight’s tour on 3D chessboards, Discrete Appl. Math. 158(16) (2010), 1727–1731.
Search in Google Scholar Back to article
[DeM07] J. DeMaio, Which chessboards have a closed knight’s tour within the cube?, Electron. J. Combin. 14(1) (2007), #R32.
Search in Google Scholar Back to article
[EGG12] J. Erde, B. Golénia, and S. Golénia, The closed knight tour problem in higher dimensions, Electron. J. Combin. 19(4) (2012), #P9.
Search in Google Scholar Back to article
[FID08] FIDE, FIDE laws of chess – articles 2&3, 79th FIDE Congress, Dresden, Germany, 2008, 3–6, available at https://www.fide.com/FIDE/handbook/LawsOfChess.pdf.
Search in Google Scholar Back to article
[Har69] F. Harary, Graph Theory, Addison-Wesley Publishing Company, 1969.
Search in Google Scholar Back to article
[Has04] D. Hastenstine, Distance and metric spaces, preprint (Math Circle for March 24 and 31), 2004, available at https://www.math.utah.edu/mathcircle/notes/distance.pdf.
Search in Google Scholar Back to article
[KL15] F. Kamalov and H.-H. Leung, Chessboard metric and median spaces, Pure Math. Sci. 4(3) (2015), 133–137.
Search in Google Scholar Back to article
[Kum12] A. Kumar, Magic knight’s tours in higher dimensions, preprint (arXiv:1201.0458 [math.CO]), 2012, available at https://arxiv.org/abs/1201.0458.
Search in Google Scholar Back to article
[OEIS23+1] OEIS Foundation Inc., Expansion of : 1+x(1-x2)4 {{1 + x} \over {\left( {1 - x^2 } \right)^4 }} : duplicated tetrahedral numbers, Entry A058187 in The On-Line Encyclopedia of Integer Sequences, 2023, available at http://oeis.org/A058187.
Back to article
[OEIS23+2] OEIS Foundation Inc., Maximal number of moves needed by a knight to reach every square from a fixed position on an n×n chessboard, or −1 if it is not possible to reach every square, Entry A232007 in The On-Line Encyclopedia of Integer Sequences, 2023, available at http://oeis.org/A232007.
Search in Google Scholar Back to article
[OEIS23+3] OEIS Foundation Inc., Maximal number of moves needed by a knight to reach every cell from a fixed position on an n×n×n chessboard, or −1 if it is not possible to reach every square, Entry A359740 in The On-Line Encyclopedia of Integer Sequences, 2023, available at http://oeis.org/A359740.
Search in Google Scholar Back to article
[OEIS23+4] OEIS Foundation Inc., Simplicial polytopic numbers, The On-Line Encyclopedia of Integer Sequences Wiki, 2023, available at https://oeis.org/wiki/Simplicial_polytopic_numbers#cite_note-4.
Search in Google Scholar Back to article
[OEIS23+5] OEIS Foundation Inc., Tetrahedral numbers: a(n)=(3n+2) a\left( n \right) = \left( {_3^{n + 2} } \right) , Entry A000292 in The On-Line Encyclopedia of Integer Sequences, 2023, available at http://oeis.org/A000292.
Back to article
[OEIS23+6] OEIS Foundation Inc., Triangular numbers: a(n)=(2n+1) a\left( n \right) = \left( {_2^{n + 1} } \right) , Entry A000217 in The On-Line Encyclopedia of Integer Sequences, 2023, available at http://oeis.org/A000217.
Back to article
[OEIS23+7] OEIS Foundation Inc., Two even followed by one odd; or ⌊ 2n3 ⌋ \left\lfloor {{{2n} \over 3}} \right\rfloor , Entry A004523 in The On-Line Encyclopedia of Integer Sequences, 2023, available at http://oeis.org/A004523.
Back to article
[Ost73] P. A. Ostrand, Graphs with specified radius and diameter, Discrete Math. 4 (1973), 71–75.
Search in Google Scholar Back to article
[Pri07] D. B. Pritchard, The Classified Encyclopedia of Chess Variants, John Beasley, 2007.
Search in Google Scholar Back to article
[QW06] Y. Qing and J. J. Watkins, Knight’s tours for cubes and boxes, Congr. Numer. 181 (2006), 41–48.
Search in Google Scholar Back to article
[Rip23] M. Ripà, Proving the existence of Euclidean knight’s tours on n × n × · · · × n chessboards for n < 4, Notes Number Theory Discrete Math. 30(1) (2024), 20–33.
Search in Google Scholar Back to article
[Sch91] A. J. Schwenk, Which rectangular chessboards have a knight’s tour?, Math. Mag. 64 (1991), 325–332.
Search in Google Scholar Back to article
[Tho11] K. P. Thompson, The nature of length, area, and volume in taxicab geometry, Int. Electron. J. Geom. 4(2) (2011).
Search in Google Scholar Back to article
[Wat04] J. J. Watkins, Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, 2004.
Search in Google Scholar Back to article