Procedure (Hand):

Select 4 Binaries out of the pairs
H1a/H1b,
H2a/H2b,
V1a/V1b and
V2a/V2b
with the 4 upper left selection buttons.

Select a sequence (1, 2 ... 24) for the four selected Binaries with the selection button left of the button ‘Shw A’ and confirm by pushing the button ‘Shw A’ (for details regarding solutions based on Binary Matrices refer to Form4b).

Press the button ‘Calculate’ to validate the selection and to calculate and visualise the resulting Most Perfect Magic Square of the 12^{th} order, based on the selected Pan Magic Square and the Pre Programmed Grids G1 and G2.
Procedure (Automatic):

Built a Most Perfect Magic Square as described above, and validate the square by pressing the button ‘Calculate’.

If you press the button ‘Report’, with all 10 Check Boxes checked (default), the report will contain only the Most Perfect Magic Square shown in the form.

By un checking more and more Check Boxes before pressing the button ‘Report’, more and more Most Perfect Magic Squares will be generated. Be careful with un checking to many Check Boxes, it might cause a time out error on your computer.
The algorithm used to generate the Magic Squares automatically is described in Section 12.5.2 and is based on the principle of Conditional Sequential Searching.
At start all independent variables have the value resulting from the constructed Most Perfect Magic Square in the form.
By un checking a Check Box, the related independent variable will vary between 1 and 256.
With the Check Boxes for the variables a(256) = 106, a(255) = 147, a(254) = 61, a(252) = 58 and a(240) = 159 checked, 384 Most Perfect Magic Squares will be generated which are shown in Attachment 12.5.
Have Fun!
