#include <stdio.h>
#define   MAXROW        8          /* maximum row range        */
#define   MAXCOL        12          /*  maximum column range    */
typedef enum boolean { FALSE, TRUE } Boolean;
typedef enum state { DEAD, ALIVE } State;
typedef State Grid[MAXROW+2][MAXCOL+2];
int neiborcc[MAXROW+2][MAXCOL+2];

Boolean UserSaysYes(void) {
 int  c;
 printf(" (y,n)? ");
 do {
  while ((c = getchar()) == '\n') ;  /* Ignore new line character.   */
  if (c == 'y' || c == 'Y' || c == 'n' || c == 'N')
    return (c == 'y' || c == 'Y');
  printf("Please respond by typing one of the letters y or n\n");
 } while (1);
}

void CopyMap(Grid map, Grid newmap) {
  int row, col;
  for (row = 0; row <= MAXROW + 1; row++)
    for (col = 0; col <= MAXCOL + 1; col++) map[row][col] = newmap[row][col];
}
int NeighborCount(Grid map, int row, int col) {
 int i;              /* row of a neighbor of the cell (row,col)  */
 int j;              /* column of a neighbor of the cell (row,col)   */
 int count = 0;      /* counter of living neighbors                  */
 for (i = row - 1; i <= row + 1; i++)
   for (j = col - 1; j <= col + 1; j++) if (map[i][j] == ALIVE) count++;

 if (map[row][col] == ALIVE) count--;
 neiborcc[row][col]=count;

 return count;
}
void Initialize(Grid map) {
    int row, col;               /* coordinates of a cell    */
    printf("This program is a simulation of the game of Life.\n"
       "The grid has a size of %d rows and %d columns.\n", MAXROW, MAXCOL);

    for (row =  0; row <= MAXROW + 1; row++)
	for (col = 0; col <= MAXCOL + 1; col++)  map[row][col] = DEAD;

    printf("On each line give a pair of coordinates for a living cell.\n"
	   "Terminate the list with the special pair 0 0.\n");

    scanf("%d %d", &row, &col);
    while (row != 0 || col != 0) {  /* Check termination condition. */
        if (row >= 1 && row <= MAXROW && col >= 1 && col <= MAXCOL)
            map[row][col] = ALIVE;
        else
            printf("Values are not within range.\n");
        scanf("%d %d", &row, &col);
    }
    printf("Input complete!!!"); getchar();
}
void WriteMap(Grid map) {
    int row, col;

    printf("\n\n\n");
    for (row = 1; row <= MAXROW; row++) {
      for (col = 1; col <= MAXCOL; col++)
	if (map[row][col] == ALIVE) putchar('*');
	else putchar('-');
      putchar('\n');
    }
    putchar('\n');
    for (row = 1; row <= MAXROW; row++) {
      for (col = 1; col <= MAXCOL; col++)
	printf("%d",neiborcc[row][col]);
      printf("\n");
    }

}

void main(void) {
    int  row, col;
    Grid map;                       /* current generation   */
    Grid newmap;                    /* next generation      */

    Initialize(map);
    WriteMap(map);
    printf("This is the initial configuration you have chosen.\n"
           "Press <Enter> to continue.\n");
    while(getchar() != '\n') ;

    do {
      for (row = 1; row <= MAXROW;    row++)
	for (col = 1; col <= MAXCOL; col++)
	  switch(NeighborCount(map, row, col)) {
	  case 0:
	  case 1:
	    newmap[row][col]= DEAD; break;
	  case 2:
	    newmap[row][col]= map[row][col];  break;
	  case 3:
	    newmap[row][col]= ALIVE; break;
	  case 4:
	  case 5:
	  case 6:
	  case 7:
	  case 8:
	    newmap[row][col]= DEAD; break;
	  }
      CopyMap(map, newmap); WriteMap(map);
      printf("Do you wish to continue viewing the new generations");
    } while (UserSaysYes());
}