Question

I have a question about my assignment. Could you please make program and give me some explanation of codes? I need c++ codes.

Conway's Game of Life is a game invented by mathematician John Conway in 1970. The rules are as follows: Each cell lives in a cell in a square (make it 10x10) grid. A cell can either be dead or alive. Before you start the game, you need to provide an initial state. You can do this by randomly setting 20 of the squares, or asking the user for sets of coordinates. The game is now ready to begin, and this involves advancing through time one step at a time. A cell's fate depends on the state of its 8 closest neighbors. • If a cell is alive, and 2 or 3 of its neighbors are also alive, the cell remains alive. • If a cell is alive and it has more than 3 alive neighbors, it dies of overcrowding. • If a cell is alive and it has fewer than 2 alive neighbors, it dies of loneliness. • If a cell is dead and it has exactly 3 neighbors it becomes alive again. Those 4 seemingly simple rules can result in wildly differing sequences. Sometimes an initial state will create an unpredictable, chaotic sequence. Other times, it will create a repeating sequence (such as the glider, pulsar, and spaceship). And other times, all cells will quickly die off or stabilize into a static formation, known as a still life, such as a 2x2 square. Your program should allow printing every generation or every 5th generation.

Answer 1

#include <iostream>
#include <fstream>

using namespace std;

// to print the grid
void print(int cells[12][12], std::ostream &myfile) {
myfile << "\t0 1 2 3 4 5 6 7 8 9 10 11" << endl;
  
   for (int i = 0; i < 12; i++) {
   myfile << i << "\t";
       for (int j = 0; j < 12; j++) {
           myfile << cells[i][j] << " ";
       }
   myfile << endl;
   }
}

// check if i, j is valid indices for grid
bool isValid(int i, int j) {
   if (i >= 0 && i < 12 && j >= 0 && j < 12)
       return true;
   else
       return false;
}

// find no of live neighbors
int findActiveNeighbours(int cells[12][12], int i, int j) {
   int activeNeighbours = 0;

   if (isValid(i - 1, j - 1) && cells[i - 1][j - 1] == 1)
       activeNeighbours++;
   if (isValid(i - 1, j) && cells[i - 1][j] == 1)
       activeNeighbours++;
   if (isValid(i - 1, j + 1) && cells[i - 1][j + 1] == 1)
       activeNeighbours++;

   if (isValid(i, j - 1) && cells[i][j - 1] == 1)
       activeNeighbours++;
   if (isValid(i, j + 1) && cells[i][j + 1] == 1)
       activeNeighbours++;

   if (isValid(i + 1, j - 1) && cells[i + 1][j - 1] == 1)
       activeNeighbours++;
   if (isValid(i + 1, j) && cells[i + 1][j] == 1)
       activeNeighbours++;
   if (isValid(i + 1, j + 1) && cells[i + 1][j + 1] == 1)
       activeNeighbours++;

   return activeNeighbours;
}

// this method simulates a round
// it changes the original array
void simulate(int cells[12][12]) {
   int newCells[12][12];
  
   // not processing border cells
   for (int i = 1; i < 11; i++) {
       for (int j = 1; j < 11; j++) {
          
           // find no of live neighbors
           int n = findActiveNeighbours(cells, i, j);
          
           if (cells[i][j] == 1) { // if cell is live
               if (n == 0 || n == 1) {
                   newCells[i][j] = 0; // mark for deletion
               } else if (n >= 4) {
                   newCells[i][j] = 0; // mark for deletion
               } else {
               newCells[i][j] = cells[i][j];
               }
           } else { // if cell is dead
               if (n == 3) {
                   newCells[i][j] = 1; // mark for generation
               } else {
               newCells[i][j] = cells[i][j];
               }
           }
       }
   }
  
   // restoring values into original array
   for (int i = 1; i < 11; i++) {
       for (int j = 1; j < 11; j++) {
       cells[i][j] = newCells[i][j];
       }
   }
}

// driver function
int main()
{
ofstream myfile;
myfile.open ("output.txt");
  
int life[12][12] =
{{0,0,0,0,0,0,0,0,0,0,0,0},
{0,0,0,0,1,0,1,0,1,0,0,0},
{0,0,0,1,0,1,0,1,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0,0,0},
{0,0,0,0,1,0,1,0,1,0,0,0},
{0,0,0,1,0,1,0,1,0,0,0,0},
{0,1,1,1,1,1,1,1,1,1,1,0},
{0,0,0,0,1,1,1,1,0,0,0,0},
{0,0,0,0,1,0,1,0,1,0,0,0},
{0,0,0,1,0,1,0,1,0,0,0,0},
{0,0,0,0,1,0,1,0,1,0,0,0},
{0,0,0,0,0,0,0,0,0,0,0,0}};
  
   myfile << "\t\t\t Game of Life\n\t\t\t--------------" << endl;
  
   int round = 1;
   myfile << "\t\tOriginal configuration" << endl;
   print(life, myfile);
   while(round <= 4) {
   myfile << "\n\t\t\t\tRound" << round << endl;
  
   simulate(life);
  
   print(life, myfile);
  
   round++;
   }
}

Sample Output:

           Game of Life
           --------------
       Original configuration
   0 1 2 3 4 5 6 7 8 9 10 11
0   0 0 0 0 0 0 0 0 0 0 0 0
1   0 0 0 0 1 0 1 0 1 0 0 0
2   0 0 0 1 0 1 0 1 0 0 0 0
3   0 0 0 0 0 0 0 0 0 0 0 0
4   0 0 0 0 1 0 1 0 1 0 0 0
5   0 0 0 1 0 1 0 1 0 0 0 0
6   0 1 1 1 1 1 1 1 1 1 1 0
7   0 0 0 0 1 1 1 1 0 0 0 0
8   0 0 0 0 1 0 1 0 1 0 0 0
9   0 0 0 1 0 1 0 1 0 0 0 0
10   0 0 0 0 1 0 1 0 1 0 0 0
11   0 0 0 0 0 0 0 0 0 0 0 0

               Round1
   0 1 2 3 4 5 6 7 8 9 10 11
0   0 0 0 0 0 0 0 0 0 0 0 0
1   0 0 0 0 1 1 1 1 0 0 0 0
2   0 0 0 0 1 1 1 1 0 0 0 0
3   0 0 0 0 1 1 1 1 0 0 0 0
4   0 0 0 0 1 1 1 1 0 0 0 0
5   0 0 0 0 0 0 0 0 0 0 0 0
6   0 0 1 0 0 0 0 0 0 1 0 0
7   0 0 1 0 0 0 0 0 0 0 0 0
8   0 0 0 1 0 0 0 0 1 0 0 0
9   0 0 0 1 0 0 0 0 1 0 0 0
10   0 0 0 0 1 1 1 1 0 0 0 0
11   0 0 0 0 0 0 0 0 0 0 0 0

               Round2
   0 1 2 3 4 5 6 7 8 9 10 11
0   0 0 0 0 0 0 0 0 0 0 0 0
1   0 0 0 0 1 0 0 1 0 0 0 0
2   0 0 0 1 0 0 0 0 1 0 0 0
3   0 0 0 1 0 0 0 0 1 0 0 0
4   0 0 0 0 1 0 0 1 0 0 0 0
5   0 0 0 0 0 1 1 0 0 0 0 0
6   0 0 0 0 0 0 0 0 0 0 0 0
7   0 0 1 1 0 0 0 0 0 0 0 0
8   0 0 1 1 0 0 0 0 0 0 0 0
9   0 0 0 1 0 1 1 0 1 0 0 0
10   0 0 0 0 1 1 1 1 0 0 0 0
11   0 0 0 0 0 0 0 0 0 0 0 0

               Round3
   0 1 2 3 4 5 6 7 8 9 10 11
0   0 0 0 0 0 0 0 0 0 0 0 0
1   0 0 0 0 0 0 0 0 0 0 0 0
2   0 0 0 1 1 0 0 1 1 0 0 0
3   0 0 0 1 1 0 0 1 1 0 0 0
4   0 0 0 0 1 1 1 1 0 0 0 0
5   0 0 0 0 0 1 1 0 0 0 0 0
6   0 0 0 0 0 0 0 0 0 0 0 0
7   0 0 1 1 0 0 0 0 0 0 0 0
8   0 0 0 0 0 0 0 0 0 0 0 0
9   0 0 1 1 0 0 0 0 0 0 0 0
10   0 0 0 0 1 0 0 1 0 0 0 0
11   0 0 0 0 0 0 0 0 0 0 0 0

               Round4
   0 1 2 3 4 5 6 7 8 9 10 11
0   0 0 0 0 0 0 0 0 0 0 0 0
1   0 0 0 0 0 0 0 0 0 0 0 0
2   0 0 0 1 1 0 0 1 1 0 0 0
3   0 0 0 0 0 0 0 0 0 0 0 0
4   0 0 0 1 0 0 0 0 1 0 0 0
5   0 0 0 0 1 0 0 1 0 0 0 0
6   0 0 0 0 0 0 0 0 0 0 0 0
7   0 0 0 0 0 0 0 0 0 0 0 0
8   0 0 0 0 0 0 0 0 0 0 0 0
9   0 0 0 1 0 0 0 0 0 0 0 0
10   0 0 0 1 0 0 0 0 0 0 0 0
11   0 0 0 0 0 0 0 0 0 0 0 0

Hi. Please find the answer above.. In case of any doubts, you may ask in comments. You may upvote the answer if you feel i did a good work!