2016/02/03 by Jared Weed, Weed, Jared
Computer Science · #FOS: Mathematics #Graph Labeling and Dimension Problems #History and Overview (math.HO)
paper · pdf · doi:10.48550/arxiv.1602.01401
openalex publication_date 2016/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In recreational mathematics, a normal magic square is an n × n square matrix whose entries are distinctly the integers 1 … n2, such that each row, column, and major and minor traces sum to one constant μ. It has been proven that there are 7,040 fourth order normal magic squares and 2,202,441,792 fifth order normal magic squares, with higher orders unconfirmed. Previous work related to fourth order normal squares has shown that symmetries such as the dihedral group exist and that (under certain conditions) normal magic squares can be categorized into four distinct subsets. With the implementation of an efficient backtracking algorithm along with supervised machine learning techniques for classification, it will be shown that the entire set of fourth order normal magic squares can be generated by expanding the symmetry groups of 95 asymmetric parents. Discussion will suggest that methods employed in this project could similarly apply to higher orders.