Question

Write a program that consists of a 10 by 10 game board, with 10 generations.

Project The Game of Life The life game consists of a board with size of NxN cells and cells are occupied by creatures. Each cell can have at most one creature. The surrounding cells are called the neighbors of this cell. Each game state is called "generation". The game progresses from one generation to the next according to the following rules: A creature that has more than 3 neighbors- dies of crowding. Its cell will be empty in the next generation. 1. 2. A creature that has less than 2 neighbors dies of loneliness. 3. If an empty cell that has exactly 3 neighbors, a new creature is born in that cell Write a program that consists of a 10 x 10 cell grid board. The program will prompt for the initial state of the world and the number of generations to be played. After each generation the program will update the state of the board and will display the updated board. The program can stop if it has reached the number of required generations or if no further changes occur (i.e, no more creatures alive or it has reached a steady or repeating pattern)

Answer 1

#include<iostream>
#include<string>

using namespace std;

int main(){

   int n,m;
   char ch;
   string s1;
   cout << "Enter number of stages:";
   cin >> m;
   char **data = new char *[10];
   for (int i = 0; i<10; i++)
       data[i] = new char[10];
   char **data1 = new char *[10];
   for (int i = 0; i<10; i++)
       data1[i] = new char[10];
   cout << "Enter " << 10 << " rows as strings\n";
   for (int i = 0; i<10; i++){
      cin >> s1;
      for (int j = 0; j<10; j++){
         data[i][j] = s1[j];
      }
   }
   int count = 0;
   for (int i = 0; i<10; i++){
          for (int j = 0; j<10; j++){
              cout << data[i][j] << " ";
          }
          cout << endl;
   }  
   n = 10;
   while(count <= m){

      for (int i = 0; i<10; i++){
          for (int j = 0; j<10; j++){
              int count1 = 0;
              if ( i-1 >= 0 && i-1 < n && j>=0 && j < n && data[i-1][j] == 'X'){
                 count1++;
              }
              if ( i-1 >= 0 && i-1 < n && j+1>=0 && j+1 < n && data[i-1][j+1] == 'X'){
                 count1++;
              }
              if ( i >= 0 && i < n && j+1>=0 && j+1 < n && data[i][j+1] == 'X'){
                 count1++;
              }
              if ( i+1 >= 0 && i+1 < n && j+1>=0 && j+1 < n && data[i+1][j+1] == 'X'){
                 count1++;
              }
              if ( i+1 >= 0 && i+1 < n && j>=0 && j < n && data[i+1][j] == 'X'){
                 count1++;
              }
              if ( i+1 >= 0 && i+1 < n && j-1>=0 && j-1 < n && data[i+1][j-1] == 'X'){
                 count1++;
              }
              if ( i >= 0 && i < n && j-1>=0 && j-1 < n && data[i][j-1] == 'X'){
                 count1++;
              }
              if ( i-1 >= 0 && i-1 < n && j-1>=0 && j-1 < n && data[i-1][j-1] == 'X'){
                 count1++;
              }
              if (count1 == 3 || count1 == 2)
                 data1[i][j] = data[i][j];
              if (count1 > 3 || count1 < 2)
                 data1[i][j] = '-';
              if (count1 == 3)
                 data1[i][j] = 'X';
          }
          cout << endl;
      }     
      for (int i = 0; i<n; i++){
          for (int j = 0; j<n; j++){
              data[i][j] = data1[i][j];
              cout << data[i][j] << " ";
          }
          cout << endl;
      }
      count++;
   }
   return 0;
}