## Constructing all magic squares of order three

- Guoce Xin
- Discrete Mathematics
- 2008

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… (More)

@inproceedings{Beck2009AU2,
title={A ug 2 00 9 ENUMERATION OF 4 × 4 MAGIC SQUARES},
author={Matthias Beck and Andrew van Herick},
year={2009}
}