魔阵是用自然数1，2，3…，n2填n阶方阵的各个元素位置，使方阵的每行的元素之和、每列元素之和及主对角线元素之和均相等。奇数阶魔阵的一个算法是将自然数数列从方阵的中间一行最后一个位置排起，每次总是向右下角排（即Aij的下一个是Ai+1,j+1）。但若遇以下四种情形，则应修正排数法。
　　（1）列排完（即j=n+1时），则转排第一列;
　　（2）行排完（即i=n+1时），则转排第一行;
　　（3）对An,n的下一个总是An,n-1;
　　（4）若Aij已排进一个自然数，则排Ai－1，j－2。(The array is 1, 2, 3 with natural numbers. N2 fills the positions of each element of the n order matrix, making the sum of the elements of each row, the sum of the elements of each row and the main diagonal elements equal. An odd order magic array is an algorithm that sets the number of natural numbers from the last line of the middle of the matrix and always rows to the right lower corner (that is, the next of Aij is Ai+1, j+1). But in the following four situations, it should be modified row number method.
(1) when row is finished (i.e. j=n+1), the first column is transferred.
(2) row row (i.e. i=n+1), then transfer to the first row.
(3) for An, the next n is always An, n-1;
(4) if Aij has been discharged into a natural number, then row Ai 1, j 2.)