Create most-perfect magic squares

A magic square is said to be most-perfect, if it contains the consecutive numbers 1, 2, …, n2 such that

  1. any four adjacent integers forming a 2x2-subsquare sum to


  2. any pair of integers distant n/2 along a diagonal sum to

    T=n2 + 1

  3. it is a double-even magic square, i.e. of order n=4k.
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 my PDF book. (chapter: Most-perfect Magic Squares)

DokumenteDetailed description of algorithms to create magic squares.