arXiv · 2306.08123
A Travelling Salesman Paths within nxn (n = 3, 4, 5) Magic Squares
Abstract
Intriguing symmetries are uncovered regarding all magic squares of orders 3, 4, and 5, with 1, 880, and 275,305,224 distinct configurations, respectively. In analogy with the travelling salesman problem, the distributions of the total topological distances of the paths travelled by passing through all the vertices (matrix elements) only once and spanning all elements of the matrix are analyzed. Symmetries are found to characterise the distributions of the total topological distances in these instances. These results raise open questions about the symmetries found in higher-order magic squares and the formulation of their minimum and maximum total path lengths.
Explore related subjects
Keep this discovery
Peyman Fahimi, Walter Trump, Cherif F. Matta, Alireza Ahmadi Baneh. 2023-06-13. A Travelling Salesman Paths within nxn (n = 3, 4, 5) Magic Squares. https://doi.org/10.61091/jcmcc125-06
Cite the original work for its findings. Save a collection to share your selection of sources.