# Magic Square

, 8 Sep 2003
 Rate this:
Please Sign up or sign in to vote.
Calculating Magic Square In Any Order Using Standard Template Library (STL)
<!-- Article image -->

<!-- Add the rest of your HTML here -->

## Introduction

Magic square is an ancient mathematical problem that many people try to solve. May be you see it in some magazines or your teacher might have introduced it in a class.

## Details

A magic square is an arrangement of numbers from 1 to n2 in an [n x n] matrix, with each number occurring exactly once, and such that the sum of the entries of any row, any column, or any main diagonal is the same.

It is not hard to show that this sum must be  n [ ( n2 + 1) / 2 ]. If we use this formula for that example output which is below, for [5x5] matrix; `5 [ ( 52 + 1 ) / 2 ] = 65`.

 17 24 1 8 15 65 23 5 7 14 16 65 4 6 13 20 22 65 10 12 19 21 3 65 11 18 25 2 9 65 65 65 65 65 65 65

Now, I want to show you a way to calculating magic squares in any order by using your talented computer.

## Siamese method

This method is useful for calculating magic squares with odd order. It begins by placing a 1 in any location (in the center square of the top row in the above example), then incrementally placing subsequent numbers in the square one unit above and to the right. The counting is wrapped around, so that falling off the top returns on the bottom and falling off the right returns on the left. When a square is encountered which is already filled, the next number is instead placed below the previous one and the method continues as before. The method, also called de la Loubere's method.

For example, if order of square is 5, we have:

```void CalculateOddMagicSquare()
{
n=5;
int matrix[5][5];

int nsqr = n * n;
int i=0, j=n/2;     // start position

for (int k=1; k<=nsqr; ++k)
{
matrix[i][j] = k;

i--;
j++;

if (k%n == 0)
{
i += 2;
--j;
}
else
{
if (j==n)
j -= n;
else if (i<0)
i += n;
}
}
}
```

Here is a very nice flash animation to show you how to fill square's cells. Thanks KIVANÇ HiKMET ANAR, for his flash.

## Complete Work

Below is full source code of calculating magic squares in any order.

```#include "stdafx.h"
#include <vector>

using namespace std;

void OddMagicSquare(vector<vector<int> > &matrix, int n);
void DoublyEvenMagicSquare(vector<vector<int> > &matrix, int n);
void SinglyEvenMagicSquare(vector<vector<int> > &matrix, int n);
void MagicSquare(vector<vector<int> > &matrix, int n);
void PrintMagicSquare(vector<vector<int> > &matrix, int n);

int main(int argc, char* argv[])
{
int n;
printf("Enter order of square: ");
scanf("%d", &n);

vector<vector<int> > matrix(n, vector<int> (n, 0));

if (n<3)
{
printf("\nError: n must be greater than 2\n\n");
return -1;
}

MagicSquare(matrix, n);

//Print results
PrintMagicSquare(matrix, n);

return 0;
}

void MagicSquare(vector<vector<int> > &matrix,int n)
{
if (n%2==1)        //n is Odd
OddMagicSquare(matrix, n);
else          //n is even
if (n%4==0)    //doubly even order
DoublyEvenMagicSquare(matrix, n);
else      //singly even order
SinglyEvenMagicSquare(matrix, n);
}

void OddMagicSquare(vector<vector<int> > &matrix, int n)
{
int nsqr = n * n;
int i=0, j=n/2;     // start position

for (int k=1; k<=nsqr; ++k)
{
matrix[i][j] = k;

i--;
j++;

if (k%n == 0)
{
i += 2;
--j;
}
else
{
if (j==n)
j -= n;
else if (i<0)
i += n;
}
}
}

void DoublyEvenMagicSquare(vector<vector<int> > &matrix, int n)
{
vector<vector<int> > I(n, vector<int> (n, 0));
vector<vector<int> > J(n, vector<int> (n, 0));

int i, j;

//prepare I, J
int index=1;
for (i=0; i<n; i++)
for (j=0; j<n; j++)
{
I[i][j]=((i+1)%4)/2;
J[j][i]=((i+1)%4)/2;
matrix[i][j]=index;
index++;
}

for (i=0; i<n; i++)
for (j=0; j<n; j++)
{
if (I[i][j]==J[i][j])
matrix[i][j]=n*n+1-matrix[i][j];
}
}

void SinglyEvenMagicSquare(vector<vector<int> > &matrix, int n)
{
int p=n/2;

vector<vector<int> > M(p, vector<int> (p, 0));
MagicSquare(M, p);

int i, j, k;

for (i=0; i<p; i++)
for (j=0; j<p; j++)
{
matrix[i][j]=M[i][j];
matrix[i+p][j]=M[i][j]+3*p*p;
matrix[i][j+p]=M[i][j]+2*p*p;
matrix[i+p][j+p]=M[i][j]+p*p;
}

if (n==2)
return;

vector<int> I(p, 0);
vector<int> J;

for (i=0; i<p; i++)
I[i]=i+1;

k=(n-2)/4;

for (i=1; i<=k; i++)
J.push_back(i);

for (i=n-k+2; i<=n; i++)
J.push_back(i);

int temp;
for (i=1; i<=p; i++)
for (j=1; j<=J.size(); j++)
{
temp=matrix[i-1][J[j-1]-1];
matrix[i-1][J[j-1]-1]=matrix[i+p-1][J[j-1]-1];
matrix[i+p-1][J[j-1]-1]=temp;
}

//j=1, i
//i=k+1, k+1+p
i=k;
j=0;
temp=matrix[i][j]; matrix[i][j]=matrix[i+p][j]; matrix[i+p][j]=temp;

j=i;
temp=matrix[i+p][j]; matrix[i+p][j]=matrix[i][j]; matrix[i][j]=temp;
}

void PrintMagicSquare(vector<vector<int> > &matrix, int n)
{
for (int i=0; i<n; i++)
{
for (int j=0; j<n; j++)
printf(" %3d", matrix[i][j]);

printf("\n");
}

printf("\n\n");
}
```

Enjoy!

## License

This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here

## About the Author

CEO Misbah3Com
Iran (Islamic Republic Of)
I was born in Shiraz, a very beautiful famous city in Iran. I started programming when I was 12 years old with GWBASIC. Since now, I worked with various programming languages from Basic, Foxpro, C/C++, Visual Basic, Pascal to MATLAB and now Visual C++.
I graduated from Iran University of Science & Technology in Communication Eng., and now work as a system programmer for a telecommunication industry.
I wrote several programs and drivers for Synthesizers, Power Amplifiers, GPIB, GPS devices, Radio cards, Data Acqusition cards and so many related devices.
I'm author of several books like Learning C (primary and advanced), Learning Visual Basic, API application for VB, Teach Yourself Object Oriented Programming (OOP) and etc.
I'm winner of January, May, August 2003 and April 2005 best article of month competetion, my articles are:

You can see list of my articles, by clicking here

## Comments and Discussions

 First Prev Next
 What's wrong with my Magic Square program? Trevon Harris 21-Feb-15 21:25
 thank you...... aravindanne 24-Jan-12 6:24
 program of magic square Member 8201258 30-Aug-11 16:58
 magic square program sheila mejos 30-Aug-11 16:09
 domino problem SOLR@C 21-May-11 16:59
 help me mashmal 11-Apr-11 12:47
 help me please to expand my knowledge in programming.. nycshoes03 17-Jul-09 18:12
 magic square samantha03 15-Jul-09 20:56
 plzz..help me..can u make me a program in magic square using C Programming Language..plzz send it 2 me by email..
 help me plzz dongky1986 4-Feb-09 2:41
 problem Member 4718823 3-Sep-08 9:54
 Help_Magic Square 007 13-Jan-08 5:45
 Can anyone help with this program [modified] Well Alright 2004 11-Jun-07 15:14
 Solvin a Magic Saquare in other method Nizar Hawat 6-Jan-07 12:45
 HeLP me to solve this probLem, pLease! winche 9-May-06 3:12
 help Shay007 30-Mar-06 20:55
 Magic Square Flaw bugDanny 26-Sep-05 4:56
 Re: Magic Square Flaw A. Riazi 26-Sep-05 5:10
 Re: Magic Square Flaw bugDanny 26-Sep-05 5:18
 hi prof Anonymous 24-Sep-05 18:24
 Complete Distributed Solution MagicSquareJoe 22-Jul-04 18:22
 Your Complete Work Anonymous 15-Nov-03 15:55
 Re: Your Complete Work Anthony_Yio 21-Dec-03 22:32
 Re: Your Complete Work Giles 13-Sep-04 3:53
 Re: Your Complete Work Anonymous 18-Sep-04 15:49
 Could you explain this line? WREY 10-Sep-03 14:33
 Re: Could you explain this line? Anonymously 10-Sep-03 16:43
 Re: Could you explain this line? John A. Johnson 10-Sep-03 21:36
 Re: Could you explain this line? WREY 10-Sep-03 23:46
 Re: Could you explain this line? A. Riazi 11-Sep-03 1:03
 Re: Could you explain this line? John A. Johnson 11-Sep-03 3:48
 Re: Could you explain this line? A. Riazi 11-Sep-03 5:38
 Re: Could you explain this line? John A. Johnson 11-Sep-03 6:47
 Re: Could you explain this line? A. Riazi 12-Sep-03 20:45
 Very interesting article, but... Kacee Giger 10-Sep-03 7:56
 Re: Very interesting article, but... Kacee Giger 10-Sep-03 8:32
 Re: Very interesting article, but... Paolo Messina 10-Sep-03 13:05
 Re: Very interesting article, but... Mister Transistor 15-Sep-03 23:56
 Re: Very interesting article, but... A. Riazi 16-Sep-03 0:37
 I would love to have your program 20 years ago... John A. Johnson 9-Sep-03 11:17
 Re: I would love to have your program 20 years ago... A. Riazi 9-Sep-03 20:07
 Re: I would love to have your program 20 years ago... WREY 10-Sep-03 12:58
 Last Visit: 31-Dec-99 19:00     Last Update: 26-Mar-15 23:26 Refresh 1

General    News    Suggestion    Question    Bug    Answer    Joke    Rant    Admin

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

| Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.150326.1 | Last Updated 9 Sep 2003
Article Copyright 2003 by A. Riazi
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid