//WARNING: Although I did get it to work, this program takes way too long to find a Magic Square. At first I didn't know whether or not it took so long, just because of all the potential combinations of outputs, but I've since seen a Magic Square program written by an experienced Programmer, and it finds a solution within a couple seconds. So I know, something's seriously wrong here! Part of it, I know, is all the print statements adding up the sides and diagonals, but I thought it would be extra rewarding to see all the sums of the sides and diagonals come out equal upon finding a Magic Square. #include #include #include #include using namespace std; //Defining the sum function, which takes 3 integers as arguments. int addnums(int x,int y,int z){ return (x + y + z);} int randomfunc(int k) { return rand() % k; } int main() { int i; int j; int row0; int zero_zero; int zero_one; int zero_two; int row1; int one_zero; int one_one; int one_two; int row2; int two_zero; int two_one; int two_two; int col0; int col1; int col2; int dia1; int dia2; //for (i = 0;i < 3;i++){ // for (j = 0;j < 3;j++){ //Generating random numbers between 1-9, with which to populate troysArray. //troysArray[i][j] = 1 + (rand() % 9); //cout << troysArray[i][j]; //cout << ""; while(true){ srand(unsigned(time(0))); vector v; // set some values from 1-9: for (int k = 1; k < 10; ++k) v.push_back(k); //Using built-in random generator random_shuffle(v.begin(), v.end()); random_shuffle(v.begin(), v.end(), randomfunc); //Print out the vector's content cout << "Randomized vector contains:"; for (vector::iterator i = v.begin(); i != v.end(); ++i) cout << ' ' << *i; int troysArray[3][3]; for (int i = 0;i < 3;i++) for (int j = 0;j <3;j++) //This is the line which treats the 1d vector like a 2d array. //Specifically, the i*3, which converts the rows to 3 at a time. troysArray[i][j] = v[i*3 + j]; cout << endl; row0 = addnums(zero_zero,zero_one,zero_two); row1 = addnums(one_zero,one_one,one_two); row2 = addnums(two_zero,two_one,two_two); col0 = addnums(zero_zero,one_zero,two_zero); col1 = addnums(zero_one,one_one,two_one); col2 = addnums(zero_two,one_two,two_two); dia1 = addnums(zero_zero,one_one,two_two); dia2 = addnums(two_zero,one_one,zero_two); if (row0 == row1 && row1 == row2 && row2 == col0 && col0 == col1 && col1 == col2 && col2 == dia1 && dia1 == dia2) { cout << "We have a magic square!" << endl; break; } else { cout << "No magic square! All rows,cols,diags do not equal!" << endl; cout << endl; } //} // cout << endl; // cout << "\n"; //} //Adding up row 0 (top row): zero_zero = troysArray[0][0]; zero_one = troysArray[0][1]; zero_two = troysArray[0][2]; row0 = addnums(zero_zero,zero_one,zero_two); //row0 = troysArray[0][0] + troysArray[0][1] + troysArray[0][2]; cout << "The sum of row 0 equals: " << zero_zero + zero_one + zero_two << endl; //cout << "The sum of row 0 equals: " << row0 << endl; //Adding up row 1 (middle row): one_zero = troysArray[1][0]; one_one = troysArray[1][1]; one_two = troysArray[1][2]; row1 = addnums(one_zero,one_one,one_two); cout << "The sum of row 1 equals: " << one_zero + one_one + one_two << endl; //Adding up row 2 (bottom row): two_zero = troysArray[2][0]; two_one = troysArray[2][1]; two_two = troysArray[2][2]; row2 = addnums(two_zero,two_one,two_two); cout << "The sum of row 2 equals: " << two_zero + two_one + two_two << endl; cout << "\n"; //Adding up col 0 (Left): col0 = addnums(zero_zero,one_zero,two_zero); cout << "The sum of col 0 equals: " << zero_zero + one_zero + two_zero << endl; //Adding up col 1 (Middle): col1 = addnums(zero_one,one_one,two_one); cout << "The sum of col 1 equals: " << zero_one + one_one + two_one << endl; //Adding up col 2 (Right): col2 = addnums(zero_two,one_two,two_two); cout << "The sum of col 2 equals: " << zero_two + one_two + two_two << endl; cout << "\n"; //Adding up tL-bR diagonal (dia 1): dia1 = addnums(zero_zero,one_one,two_two); cout << "The sum of dia 1 equals: " << zero_zero + one_one + two_two << endl; //Adding up bL-tR diagonal (dia 2): dia2 = addnums(two_zero,one_one,zero_two); cout << "The sum of dia 2 equals: " << zero_two + one_one + two_zero << endl; } return 0; }

magicSquare