A New Procedure for Magic Squares (Part IC)

Centered Sequential Mask-Generated Squares

A mask

A Discussion of the New Method

Skip the discussion go to examples

This method differs from the Centered Sequential Mask-Generated Squares (Part IA) which employs 4n + 1 squares. The 4n + 3 squares are produced via an alternative novel route using a sequence of numbers (either positive or negative) which tells us the direction and number of steps to move during a break.

  1. We begin by placing the numeral 1 in the center cell of the top row and consecutively entering the next numeral into every other cell as was shown in the previous page. After partially filling in the first row (1 down,1 right) or the equivalent (1 right,1 down) knight move is used to get to the next row (see the examples below).
  2. Upon reaching the row adjacent to the center row, the numbers are filled in a zig zag pattern as was shown in Zig Zag Consecutive 7x7 Mask-Generated Squares leaving the center row unfilled in the first pass. After filling in the zig zag rows continue as before filling bottom of the square as was previously done employing (1,down,1,right) knight moves as breaks. From the last row go to the center row and fill in the center row, followed by the bottom rows. (Best seen in the examples). From the bottom row we jump back to the zig zag rows and fill these in in reverse order, followed by inserting the next number into the last cell in the first row.
  3. The first move is to add the numbers in reverse order until the first row is filled in. This ensures that the square is primed to use the new break sequences which may be either either positive (move in the right direction) or negative numbers (move in the left direction). In addition the size of the numeral tells how many steps to travel in that direction including the (1 down) break. The rest of the square is filled in using these numerical sequences and are filled in the direction shown in the last column of the sequence table shown below.

After converting the squares into semi-magic ones the square are converted into magic ones by the use of a mask. This mask generates numbers which are added to certain cells in the square to produce a final square composed of numbers which may not be in serial order. For example, negative numbers or numbers greater than n2 may be present in the square.

In addition, it will also be shown that the sums of these squares follows either of the two sum equations shown in the New block Loubère Method and Consecutive 5x5 Mask Generated squares:

S = ½(n3 ± an)
S = ½(n3 ± an + b)

Construction of the Break Sequence Table

Table S is generated by using the following general sequence:

{ ½(n + 1), [½(n - 3), - ½(n + 1)]r }

where n is an odd number of the type 4m + 3 and r is a repeating sequence equal to ¼(n - 7).

 
nr
7
111
152
193
234
 
Sequence Table
Number of cells to move per breakDirection of row fillings
(4)R
(6, 4, -6)R, L, R
(8, 6, -8, 6, -8)R, L, R, L, R
(10, 8, -10, 8, -10, 8, -10)R, L, R, L, R, L, R
(12, 10, -12, 10, -12, 10, -12, 10, -12)R, L, R, L, R, L, R, L, R

Construction of a 7x7 Magic Square

Method: Sequential Readout - use of a mask
  1. Construct the 7x7 Square 1 where 7 = 4n + 3 by adding numbers in a consecutive manner starting at row 1 cell 4 and filling every other the cell (square 1).
  2. Upon reaching the numeral 3 generate a (1 right, 1 down) knight break move and continue filling cells in a normal fashion.
  3. Upon reaching 7 go down one cell to 8 and add numbers sequentially in a zig zag pattern skipping over center row.
  4. From 14 go down three cells to 15 and continue adding numbers form right to left. From 21 go to the center row and fill in the row consecutively (square 2). Drop down to 29 fill in the last two rows using a (1 right, 1 down) knight break move.
  5. 1
    3 1 2
    74 5 6
    810 12 14
     
    911 13
    1617 18 15
    2021 19
    2
    3 1 2
    74 5 6
    810 12 14
    22232425 26 2728
    911 13
    163017 31 18 2915
    34203521 32 1933
  6. From 35 go to 36 and repeat the zig zag in a reverse manner.
  7. From 42 go to the last cell in the first row and insert 43. Continue filling in the first row in reverse order (Square 4). This primes the square for the new break sequences.
  8. At 46 go a distance of four units ( 3 right, 1 down) as directed in the first line of the sequence table.
  9. Continue filling in the second row moving to the right as shown in the last column of the sequence table. At this point all columns at this point sum to 175, while the row sums are to be adjusted (by + or - values) according to the last cell in square 4 in order to sum to 175.
  10. Square 5 shows the result of the adjustment with the generation of 1 pink duplicate.
  11. 3
    3 1 2
    74 5 6
    8411039 12 3714
    22232425 26 2728
    4294011 38 1336
    163017 31 18 2915
    34203521 32 1933
    4
    232
    46 3 45 144 243184-9
    749447 5 4861669
    8411039 12 371416114
    22232425 26 27281750
    4294011 38 1336189 -24
    163017 31 18 291515619
    34203521 32 1933194 -19
    175175175 175175175 175230
    5
    232
    46 3 45-8 44 243175
    749456 5 486175
    8411053 12 3714175
    22232425 26 2728175
    42940-3 38 1336175
    16301750 18 2915175
    3420352 32 1933175
    175175175 175175175 175230
    +
  12. Generate a mask whereby the sums of the columns and rows are constructed as in the box below. This assures that when each of these values is added to the corresponding cell in square 4 (as in the de la Hire method) that all sums will be equal.
Mask A
57 55
112
55 57
55 57
57 55
55 57
57 55
6
154
46 60 45 -8445743154
749116 56 5486154
84110 108 123771 154
772324 25 832728 154
99940 -3 381391154
168517 50 188615 154
342035 59 871933 154
154154154 154 154154 154154

This completes this section on a new Centered Sequential Mask-Generated Squares (Part IC). The next section deals with Centered Sequential Mask-Generated Squares (Part ID). To return to homepage.


Copyright © 2010 by Eddie N Gutierrez. E-Mail: Fiboguti89@Yahoo.com