#include

#define MAXSIZE 50 //define Maximum size

#define MAXTIME 50 //define maximum time step size

int neighbors(int anArray[MAXSIZE][MAXSIZE][MAXTIME+1], int i, int j, int size, int step)// returns the number of neighbors of position i,j that are alive at time step.

{

int totalCount=0; //initilaizes the total count

if(i>=0 && j>=0 && i

{

if(j-1>=0)

{

if(anArray[i][j-1][step]==1)

totalCount++;

if(i-1>=0)

if(anArray[i-1][j-1][step]==1)

totalCount++;

if(i+1

if(anArray[i+1][j-1][step]==1)

totalCount++;

}

if(j+1

{

if(anArray[i][j+1][step]==1)

totalCount++;

if(i-1>=0)

if(anArray[i-1][j+1][step]==1)

totalCount++;

if(i+1

if(anArray[i+1][j+1][step]==1)

totalCount++;

}

if(i-1>=0)

if(anArray[i-1][j][step]==1)

totalCount++;

if(i+1

if(anArray[i+1][j][step]==1)

totalCount++;

}

return totalCount;

}

void printGrid(int myGrid[MAXSIZE][MAXSIZE][MAXTIME+1],int size,int step) // prints the grid of size sizexsize at time step.

{

int r=0,c=0;

while(r

{

printf(" ");

c=0;

while(c

{

printf(" %d",myGrid[r][c][step]);

c++;

}

r++;

}

}

int main() //main function

{

printf("Welcome to Conway's game of Life "); //prints welcome to the game message

printf("Please enter the n for the n by n grid to simulate, max size for n is 50. :"); //prints a senetnce to ask the user to enter the grid demension

int n=0; //initializes the n

scanf("%d",&n); //scans the maximum size for n users enters

int gridArr[MAXSIZE][MAXSIZE][MAXTIME+1]={0}; //3d grid array

if (n > 50) // If the user enters a grid size greater than 50, the code will print error and exit.

{

printf("Error ");

}

else {

printf(" Thank You,now enter the initial x y coordinate(the board is indexed starting from 0 0) for the initial live cells,enter -1 -1 when done ");

int r=0,c=0; //initializes the row r and column c is 0

while(r!=-1||c!=-1)

{

scanf("%d %d",&r,&c);

gridArr[r][c][0]=1;

}

int ts=0; //initializes the time step ts is 0

printf(" Please enter the number of time steps you wish to simulate, max number allowed is 50."); //asks the user to enter time step

scanf("%d",&ts);

if (ts>50) // If the user enters a timestep greater than 50, the code will print error and exit.

{

printf("Erorr. ");

}

else {

printf("Num time steps %d ",ts);//prints the time step

printf("After %d timesteps the grid is: ",ts);

int i,j,k=1;

k=0;

while(k<=ts)

{

i=0;

while(i

{

j=0;

while(j

{

if(gridArr[i][j][k]==1)

{

if(neighbors(gridArr,i,j,n,k)==2||neighbors(gridArr,i,j,n,k)==3)//call neighbors() function

gridArr[i][j][k+1]=1;

else

gridArr[i][j][k+1]=0;

}

else if(gridArr[i][j][k]==0)

{

if(neighbors(gridArr,i,j,n,k)==3)

gridArr[i][j][k+1]=1;

}

j++;

}

i++;

}

k++;

}

printGrid(gridArr,n,ts);

printf(" ");

}

}

return 0;

}

We will be using the concepts from project 2 to test the more recent concepts of linked lists, pointers, and file I/O. The initial data points will be stored in a file (specification of the layout of the file below), each grid of values will be dynamically allocated and then referenced via a pointer in a linked list.

More details are:

input file

first line will list the number of time steps to simulate

second line will include number of rows followed by the number of columns in the grid to be simulated

remaining lines in the file will have the positions of the initial cells that are "alive"

dynamically create nodes that use the following struct

 struct node { int rows; int columns; int * grid; // a pointer to the grid that should be of size rows*columns struct node *next_step; // a pointer to the node that holds the grid for the next time step };

you will create a linked list of nodes where each node is a single time step

the begin pointer should point to the initial grid, and each time step should follow.

no array notation is to be used, so no []'s should appear in your code.

You MUST create the following functions

 struct node *createInitialNode(FILE *input, int *numsteps); // read data from file pointer input and return a dynamically created node with the data and the number of time steps to simulate in numsteps void nextStep(struct node *begin); // add a struct node to the end of the list pointed to by begin for the next time step, so use data in the last node in the list to create the new timestep. void printList(struct node *begin); // print out all the grids contained in the list pointed to by begin.

Code frpm PROJECT 2 :