## Most-perfect magic squares

A magic square is said to be *most-perfect*, if it contains the consecutive numbers 1, 2, …, n^{2} such that

- any four adjacent integers forming a 2x2-subsquare sum to
- any pair of integers distant n/2 along a diagonal sum to
T=n^{2} + 1

- it is a double-even magic square, i.e. of order n=4k.

All algorithms are described in detail in chapter *Most-perfect Magic Squares (german: Supermagische Quadrate)* together with some other PDF documents.

Detailed description of algorithms to create magic squares