Octagon Algorithm for Partial Border Wheel Squares (Part XVII)

Picture of a wheel

The Eight Node Way - (a,c,e) Squares

The previous section Part XVI dealt with a group of partial border 7×7 squares with non magic internal 3×3 squares. Attempts were made to use the same algorithms as used in Part XVI to construct 9th order squares but were unsuccessful. Construction of the 9th order, however, was possible using several octogonal algorithms to generate the partial border squares. It was found that one type of square (Non Border A5) constructed via parity Part III could be converted into the simpler looking Non Border 9a(4,8,12) below which could then be transformed into a partial border square where its complementary table had a more complex structure.

9×9 Wheel Border Squares

It was found that he number of algorithms required to fill in the non spoke sections for the square derived from A5 was found to be between 4 and 5 and probably will grow in numbers as the order of the square increases. So it was decided to focus on only one 9th order square which, however, will be depicted without the algorithms. Instead I will depict the squares and how the connections between the non spoke numbers in the complementary table differ from each other. The first square 9a and its accompanying complementary table was constructed from A5 by moving the lower numbers from the inner portion of the square to the periphery of the square and vice versa:

Picture of sequence
Non Border A5
772527 291 53555745
517613 1626768 4432
496475 223 614318 34
476360 744 42241936
910 1112 4170 7172 73
352021 4078 8596246
331739 5879 2376548
313869 668015 14650
375654 5281 3028265
   ⇒
Non Border 9a(4,8,12)
771317 211 61656945
677625 3025356 4416
635475 343 494328 20
595148 744 42363124
910 1112 4170 7172 73
233233 4078 8475058
192739 4679 3575562
153857 528029 26666
376864 6081 2218145

We can convert 9a to a different square 9b by exchanging the numbers 15 and 19 in the first column with 16 and 20 in the last column. In addition, shifting the numbers 22, 23, 21, and 24 to different positions on the perimeter of the square requires that the internal numbers be modified so as to maintain a Sum of 369 for each row and column. The partial complementary table of 9b shows that the connections between numbers is now more complex as depicted below and again with four different kinds of octogonal algorithms:

Picture of sequence
Border 9b(4,8,12)
771317 231 61646845
677629 2525556 4415
634775 333 514335 19
585449 744 42362824
910 1112 4170 7172 73
223031 4078 8485260
203239 4679 3475062
163853 578027 26666
376965 5981 2118145

We can convert 9b to 9c six units to the right by shifting all the non spoke numbers and moving the terminal structure starting at 31 to position 13. The internal numbers 31-36 now take on the values 13-18 with all the other non spoke numbers changing as well. This shift of 6 units to the right changes the complementary table to:

Picture of sequence

producing square 9c while using the same Octagonal algorithms as 9b:

Border 9c(4,8,12)
771923 291 55586245
617635 3124950 4421
576575 153 694317 25
524867 744 42183430
910 1112 4170 7172 73
283613 4078 8664654
261439 6479 1676856
223847 518033 32660
376359 5381 2724205

On the other hand, it is possible to produce higher order squares using parity (knowing which odd and even complementary sums are required to fill in a row or column). Once the square is constructed one can determine which algorithms to use to fill in the non spoke numbers as well as the connectivity between numbers in the complementary table. It's a much easier task than trying to build the square from scratch without the requisite algorithms.

This completes Part XVII. Go back to Part XVI. Go back to homepage.


Copyright © 2022 by Eddie N Gutierrez. E-Mail: enaguti1949@gmail.com