A magic square is said to be most-perfect, if it contains the consecutive numbers 1, 2, …, n2 such that
T=n2 + 1
|Ollerenshaw - Brée|
|de Winkel (OddSwap)|
|de Winkel (Dynamic numbering)|
|Transformation of pandiagonal Franklin squares
(only order n=8)
All algorithms are described in detail in chapter Most-perfect Magic Squares (german: Supermagische Quadrate) together with some other PDF documents.