Numerous but Rare: An Exploration of Magic Squares
نویسندگان
چکیده
How rare are magic squares? So far, the exact number of magic squares of order n is only known for n ≤ 5. For larger squares, we need statistical approaches for estimating the number. For this purpose, we formulated the problem as a combinatorial optimization problem and applied the Multicanonical Monte Carlo method (MMC), which has been developed in the field of computational statistical physics. Among all the possible arrangements of the numbers 1; 2, …, n(2) in an n × n square, the probability of finding a magic square decreases faster than the exponential of n. We estimated the number of magic squares for n ≤ 30. The number of magic squares for n = 30 was estimated to be 6.56(29) × 10(2056) and the corresponding probability is as small as 10(-212). Thus the MMC is effective for counting very rare configurations.
منابع مشابه
Enumeration of 4× 4 Magic Squares
A magic square is an n × n array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for n = 4, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the n = 3 case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane a...
متن کاملA ug 2 00 9 ENUMERATION OF 4 × 4 MAGIC SQUARES
A magic square is an n × n array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for n = 4, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the n = 3 case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane a...
متن کاملPolyhedral Cones of Magic Cubes and Squares
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes. Magic cubes and squares are very popular combinatorial objects (see [2, 15, 17] and their references). A magic square is a square matrix whose entries are nonnegative integers and whose row sums, column sums...
متن کاملEnumeration of 4 x 4 magic squares
A magic square is an n × n array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for n = 4, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the n = 3 case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane a...
متن کاملBordered magic squares: Elements for a comprehensive approach
General methods for the construction of magic squares of any order have been searched for centuries. Several " standard strategies " have been found for this purpose, such as the " knight movement " , or the construction of bordered magic squares, which played an important role in the development of general methods. What we try to do here is to give a general and comprehensive approach to the c...
متن کامل