Magic squaresContact / guestbookMost magic square per order3x3 magic square3x3 magic square, explanationSudoku method (1)Sudoku method (2)Sudoku method (3)Pan magic 4x4 squarePan magic 4x4 square, explanationPan magic 4x4 square, binaryDürer & Franklin transformationTransformation methodTransformation method, analysis[ultra] pan magic 5x5 squarePan magic 5x5 square, explanation6x6 magic squareUltra (pan)magic 8x8 squareMost perfect magic squares, explanation8x8 most perfect magic squares, binaryKhajuraho methodKhajuraho method, explanationBasic pattern method (1a)Basic pattern method (1b)Basic pattern method (2)Basic pattern method (3a)Basic pattern method (3b)Basic pattern method (3c)Basic pattern method (4)Basic pattern method (5)Basic pattern method (6)Basic pattern method (7a)Basic pattern method (7b)Analysis Franklin panm. 8x8 (1)Analysis Franklin panm. 8x8 (2)Basic key method (1)Basic key method (2)Quadrant method (Willem Barink)Quadrant method group 1 up to 5Quadrant method group 6 up to 10Quadrant method group 11 up to 19[ultra] pan magic 9x9 square (1)pan magic 9x9 square (2)pan magic 9x9 square (3)3x extra magic 9x9 square10x10 magic squareComposite 12x12 magic square14x14 magic square[Ultra] pan magic 15x15 square3x extra magic 15x15 squareThe perfect magic square3x extra magic 18x18 squareUltra pan magic 25x25 square[ultra] pan magic 27x27 square[ultra] pan magic 35x35 squareextra magic 35x35 squareBordered squaresInlaid square (1)Inlaid square (2)Each magic sumWater retention challengeMost magic 4x4x4 cubesymmetric & semi (pan)magic 5x5x5 cubeSymmetric & panmagic 7x7x7 cubePerfect (Nasik) & compact 8x8x8 cube[More than] perfect magic 9x9x9 cubePerfect (Nasik) magic 11x11x11 cubePerfect (Nasik) magic 15x15x15 cubeTrick with 8x8 bimagic squareFavorite Links
How to make perfect magic squares & cubes
The sky is the limit!!!
Quadrant method group 1 up to 5
<HOME>                         <<PREVIOUS]                         [NEXT>>




Illustration group 1

Magic squares of group 1 can be constructed by means of combining G-grids (i.e. all quadrants have
a G-structure) with G*-grids (i.e. all quadrants have a G*-structure).
 
First you construct the 8x8 row grid. Fill the upper left quadrant with the digits after G1, G2, G3, G4,
G5 or G6. In the example G1 has been chosen.
 
 
             G1 (row grid), step 1
0
6
7
1
 
 
 
 
7
1
0
6
 
 
 
 
0
6
7
1
 
 
 
 
7
1
0
6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

 
 
Necessarily the same G-quadrant must be repeated in the down left corner (as is shown with the
purple digits).
 
          G1 (row grid), step 2
0
6
7
1
 
 
 
 
7
1
0
6
 
 
 
 
0
6
7
1
 
 
 
 
7
1
0
6
 
 
 
 
0
6
7
1
 
 
 
 
7
1
0
6
 
 
 
 
0
6
7
1
 
 
 
 
7
1
0
6
 
 
 
 
 
 
The right half of the row grid must be filled with the digits 2, 3, 4, and 5. In column 5 and 7 it is
only possible to continue with an alteration of 2-5, 5-2, 3-4, or 4-3, that is four options. In the
example 2-5 has been chosen.
 
 
                 G1 (row grid), step 3
0
6
7
1
2
 
5
 
7
1
0
6
5
 
2
 
0
6
7
1
2
 
5
 
7
1
0
6
5
 
2
 
0
6
7
1
2
 
5
 
7
1
0
6
5
 
2
 
0
6
7
1
2
 
5
 
7
1
0
6
5
 
2
 
 
 
Now in column 6 and 8 it is only possible to continue with an alteration of 3-4 or 4-3, that is two
options. In the example 4-3 has been chosen.
 
 
           G1 (row grid), step 4
0
6
7
1
2
4
5
3
7
1
0
6
5
3
2
4
0
6
7
1
2
4
5
3
7
1
0
6
5
3
2
4
0
6
7
1
2
4
5
3
7
1
0
6
5
3
2
4
0
6
7
1
2
4
5
3
7
1
0
6
5
3
2
4
 
 
In total there are 6 (G1 to G6) x 4 (options of step 3) x 2 (options of step 4) = 48 possible row grids.
 
By reflecting the 48 row grids diagonally you can produce 48 column grids. In the G-group it is pos-
sible to match all 48 row grids with all 48 column grids. See below one of the 64 possible squares
of G1/G1*. Note that in the example the column grid is the reflection of the row grid. 

 
   1x digit from row grid +        +      8x digit from column grid      =      most perfect 8x8 magic square
0
6
7
1
2
4
5
3
 
 
0
7
0
7
0
7
0
7
 
 
1
63
8
58
3
61
6
60
7
1
0
6
5
3
2
4
 
 
6
1
6
1
6
1
6
1
 
 
56
10
49
15
54
12
51
13
0
6
7
1
2
4
5
3
 
 
7
0
7
0
7
0
7
0
 
 
57
7
64
2
59
5
62
4
7
1
0
6
5
3
2
4
 
 
1
6
1
6
1
6
1
6
 
 
16
50
9
55
14
52
11
53
0
6
7
1
2
4
5
3
 
 
2
5
2
5
2
5
2
5
 
 
17
47
24
42
19
45
22
44
7
1
0
6
5
3
2
4
 
 
4
3
4
3
4
3
4
3
 
 
40
26
33
31
38
28
35
29
0
6
7
1
2
4
5
3
 
 
5
2
5
2
5
2
5
2
 
 
41
23
48
18
43
21
46
20
7
1
0
6
5
3
2
4
 
 
3
4
3
4
3
4
3
4
 
 
32
34
25
39
30
36
27
37
 
 
The combination G/G* gives in total 48x48 = 2304 squares. The collection of squares belonging to
the combination G*/G (= swapping row and column grids) gives also 2304 squares. But: are they
new squares?

Something about swapping (c/r-switch)
 
In the above special example it is easy to see that the swapping gives the diagonal reflected speci-
men of the original square. But what about this (arbitrary) second example:
 
 
              G1                                                  G3*
0
6
7
1
2
4
5
3
 
 
0
7
0
7
0
7
0
7
 
 
1
63
8
58
3
61
6
60
7
1
0
6
5
3
2
4
 
 
5
2
5
2
5
2
5
2
 
 
48
 
 
 
 
 
 
 
0
6
7
1
2
4
5
3
 
 
7
0
7
0
7
0
7
0
 
 
57
 
 
 
 
 
 
 
7
1
0
6
5
3
2
4
 
 
2
5
2
5
2
5
2
5
 
 
24
 
 
 
 
 
 
 
0
6
7
1
2
4
5
3
 
 
1
6
1
6
1
6
1
6
 
 
9
 
 
 
 
 
 
 
7
1
0
6
5
3
2
4
 
 
4
3
4
3
4
3
4
3
 
 
40
 
 
 
 
 
 
 
0
6
7
1
2
4
5
3
 
 
6
1
6
1
6
1
6
1
 
 
49
 
 
 
 
 
 
 
7
1
0
6
5
3
2
4
 
 
3
4
3
4
3
4
3
4
 
 
32
 
 
 
 
 
 
 
                                              
 
Swapping the grids gives the following:
 
 
               G3*                                                G1
0
7
0
7
0
7
0
7
 
 
0
6
7
1
2
4
5
3
 
 
1
56
57
16
17
40
41
32
5
2
5
2
5
2
5
2
 
 
7
1
0
6
5
3
2
4
 
 
62
 
 
 
 
 
 
 
7
0
7
0
7
0
7
0
 
 
0
6
7
1
2
4
5
3
 
 
8
 
 
 
 
 
 
 
2
5
2
5
2
5
2
5
 
 
7
1
0
6
5
3
2
4
 
 
59
 
 
 
 
 
 
 
1
6
1
6
1
6
1
6
 
 
0
6
7
1
2
4
5
3
 
 
2
 
 
 
 
 
 
 
4
3
4
3
4
3
4
3
 
 
7
1
0
6
5
3
2
4
 
 
61
 
 
 
 
 
 
 
6
1
6
1
6
1
6
1
 
 
0
6
7
1
2
4
5
3
 
 
7
 
 
 
 
 
 
 
3
4
3
4
3
4
3
4
 
 
7
1
0
6
5
3
2
4
 
 
60
 
 
 
 
 
 
 
 

Despite the incompleteness of the final squares it can easily be established that the second square
is different from the first one! So, swapping gives new squares? Let us continue our investigation
and now reflect diagonally this second square, and see what happens:

 
                G3                                                  G1*
0
5
7
2
1
4
6
3
 
 
0
7
0
7
0
7
0
7
 
 
1
62
8
59
2
61
7
60
7
2
0
5
6
3
1
4
 
 
6
1
6
1
6
1
6
1
 
 
56
 
 
 
 
 
 
 
0
5
7
2
1
4
6
3
 
 
7
0
7
0
7
0
7
0
 
 
57
 
 
 
 
 
 
 
7
2
0
5
6
3
1
4
 
 
1
6
1
6
1
6
1
6
 
 
16
 
 
 
 
 
 
 
0
5
7
2
1
4
6
3
 
 
2
5
2
5
2
5
2
5
 
 
17
 
 
 
 
 
 
 
7
2
0
5
6
3
1
4
 
 
4
3
4
3
4
3
4
3
 
 
40
 
 
 
 
 
 
 
0
5
7
2
1
4
6
3
 
 
5
2
5
2
5
2
5
2
 
 
41
 
 
 
 
 
 
 
7
2
0
5
6
3
1
4
 
 
3
4
3
4
3
4
3
4
 
 
32
 
 
 
 
 
 
 
 

And we establish that the swapping of G1/G3* gives the diagonal reflection of G3/G1*, and that
is a square belonging to the first 2304 squares already made.
 
So, the conclusion is that combinations of two grids that structurally are reflections
of each other (e.g. combination 1, 3a,3b, 4a, etc…) give no new squares when swap-
ping the grids.   
 
Consequently, the amount of squares of combination 1, the G-group, is 2304.
 
The first square we made contains the extra magic property X. Make sure that this property can
only arise in case of the following 6 sequences of digits in the first row or column: 0-6-7-1-2-4-5-3,
0-6-7-1-4-2-3-5, 0-5-7-2-1-4-6-3, 0-5-7-2-4-1-3-6, 0-3-7-4-1-2-6-5 and 0-3-7-4-2-1-5-6. Conse-
quently the amount of squares in group 1 containing this property is 6 x 6 = 36. 

 
 
Illustration group 2

Magic squares of group 2 can be produced by means of combining A-grids with B-grids.
 
First you construct the row grid. Fill the upper left quadrant after A1, A2 or A3. In the example A1
has been chosen.
 
 
              A1 (row grid), step 1
0
7
6
1
 
 
 
 
7
0
1
6
 
 
 
 
1
6
7
0
 
 
 
 
6
1
0
7
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
In the 5th row you can only continue with 0-7-6-1 or 1-6-7-0. With both options you can finish the
down left quadrant, continuing the A-structure (N.B.: that is a choice, you are going to construct
an A-grid!). In the example 0-7-6-1 has been chosen, which means repeating the first quadrant.
 
 
          A1 (row grid), step 2
0
7
6
1
 
 
 
 
7
0
1
6
 
 
 
 
1
6
7
0
 
 
 
 
6
1
0
7
 
 
 
 
0
7
6
1
 
 
 
 
7
0