//acadlife.cpp
//(c) 1997, Oguz Yetkin
//physics 505
//revised 2/1998 for phys499
//
//Implements "academic life" where cells interact with "colleagues"
//otherwise, rules are the same as life (unless otherwise specified)
//
//Game of life, and other good stuff


//#include "graph.h"


#include <graphics.h>	//will have to use borland c++ graphics directly :(
					//for getpixel and putpixel
#include <conio.h>
#include <stdio.h>
#include <iostream.h>
#include <stdlib.h>		//for exit
#include <assert.h>

const int GEN=2;	//number of generations to keep+ 1 reserved layer
				//(the GENth layer) for neighbor index
//const int I=70;
//const int J=70;
const int I=40;
const int J=30;
const int NEIGHBORS_PER_CELL=8;	//we are no longer limited by geometry

#define NUM_CELLS I * J

const int offset=20;	//offset to plot

struct point{

	int i;
	int j;
};

struct neighlist{
	point list[NEIGHBORS_PER_CELL];
};

//const int ITER=300;


//remains unchanged in academic life
inline int fate(int value,int num_neighbors);		//return 0 or 1

inline int count_neighbor(neighlist neighbors[NUM_CELLS], int array[GEN+1][I][J], int i, int j,int gen); //assume I and J there

int main(int argc, char** argv){

	int world[GEN+1][I][J];	//2 2-d arrays in a 3-d array
						//the extra layer (layer 3) is for neighbor index

	int world2[GEN+1][I][J];	//parallel universe

	neighlist neighbors[NUM_CELLS];	//virtual "neighbors" can be anywhere
							//on the grid (more like colleagues)
	//neighlist neighbors2[NUM_CELLS];
	long int neighboridx;

	int gen=0;	//either 0 or 1
	int iter=0;
	int curr_generation=0;

	int maxcolor;
	long int i,j,k,m,n,o;	//for iterating up to millions
	char ch;
	cout<<"\nAcadLife 1.0, by Oguz Yetkin, oguz@writeme.com";
	cout<<"\npress q to stop the program";
	cout<<"\nThis is a non-straighforward implementation of LIFE,";
	cout<<"\nThe code is probably on";
	cout<<"\nhttp://www.cs.wisc.edu/~yetkin/code\n"<<endl;
	cout<<"\n\nmax iterations: ";
	cin>>iter;


	int maxx,maxy;

	//initialize graphics
	//************************************
	int driver=DETECT;
	int mode;
	registerbgidriver(EGAVGA_driver);
	//int maxx, maxy;	//will be 640x480


	//**************INIT GRAPHICS**********************
	initgraph(&driver, &mode, "");	//driver linked in
	//mode=CGAC0;
	//initgraph(&driver, &mode,"h:\\borlandc\\bgi");

	maxx=getmaxx();
	maxy=getmaxy();
	maxcolor=getmaxcolor();
	//cout<<maxcolor<<endl;
	//getch();

	//**************END GRAPHICS SETUP*****************


	//zero out worlds
	//cout<<"\ngrafx init...";
	for(gen=0;gen<GEN+1;gen++){	//+1 accounts for neighbor layer
		for(i=0;i<I;i++){
			for(j=0;j<J;j++){
				world[gen][i][j]=0;
				world2[gen][i][j]=0;
			}
		}
	}

	randomize();
	//fill main world with random nums;
	for(i=0;i<I;i++){
		for(j=0;j<J;j++){
			world[0][i][j]=random(2);
		}
	}
	//copy world into parallel universe

	for(i=0;i<I;i++){
		for(j=0;j<J;j++){
			world2[0][i][j]=world[0][i][j];
		}
	}
	//cout<<"\nworld copied...";
	//assign random neighbors across the grid in the 3rd layer
	for(i=0;i<I;i++){
		for(j=0;j<J;j++){
			neighboridx=random(NUM_CELLS);
			world[GEN][i][j]=neighboridx;
			world2[GEN][i][j]=neighboridx;
		}
	}
	//cout<<"\nrandom neighbors assigned...";
	//now alter one point in the parallel universe
	world2[0][15][25]=!world2[0][15][25];

	//now initialize the list of neighbors with random
	//values which are within the range.  For now,
	//both arrays have the same neighbor list.

	for(k=0;k<NUM_CELLS;k++){
		for(m=0;m<NEIGHBORS_PER_CELL;m++){

			neighbors[k].list[m].i=random(I);
			neighbors[k].list[m].j=random(J);
		}
	}
	//cout<<"\nneighbor list initialized, copying it...";
	//now copy the neighbors list into neighbors2
	/* let's skip this step for now

	for(k=0;k<NUM_CELLS;k++){
		for(m=0;m<NEIGHBORS_PER_CELL;m++){

			neighbors2[k].list[m].i=neighbors[k].list[m].i;
			neighbors2[k].list[m].j=neighbors[k].list[m].j;
		}
	}
	cout<<"\nneighbor list copied, starting life!\n";
	*/
	//cout<<"\nskipped copying neighbors, starting life!\n";


	//start LIFE
	for(curr_generation=0;curr_generation<iter;curr_generation++){

		gen=curr_generation%2;

		for(i=0;i<I;i++){
			for(j=0;j<J;j++){
				//put whatever we want in next generation's array
				world[((gen+1)%2)][i][j]=
					fate(world[gen][i][j],
						count_neighbor(neighbors, world,i,j,gen));

				world2[((gen+1)%2)][i][j]=
					fate(world2[gen][i][j],
						count_neighbor(neighbors, world2,i,j,gen));
			}//end inner for
		}//end outer for

		//cout<<"\ngen: "<<curr_generation<<endl;
		for(i=0;i<I;i++){
			for(j=0;j<J;j++){

				if(world[((gen+1)%2)][i][j]==1){
					putpixel(i,j,WHITE);

				}else{
					putpixel(i,j,BLACK);
				}//end if,then,else
			}//end inner for
		}//end outer for

		//paint the parallel universe
		for(i=0;i<I;i++){
			for(j=0;j<J;j++){

				if(world2[((gen+1)%2)][i][j]==1){
					putpixel(i+I+offset,j,WHITE);

				}else{
					putpixel(i+I+offset,j,BLACK);
				}//end if,then,else
			}//end inner for
		}//end outer for
		//clrscr();
	}//end huge for loop

	getch();
	closegraph();
	cout<<"\nwe hope you have enjoyed life\n";
	return 1;

}//end main



inline int fate(int value,int num_neighbors){



	if(value==1){

		if((num_neighbors==2)||(num_neighbors==3)){
			return 1;	//stays alive
		}else{
			return 0;	//dies of loneliness or overcrowding
		}
	}else{

		if(num_neighbors==3){
			return 1;		//we have a new baby!!!
		}else{
			return 0;		//stay dead
		}
	}//end outer else


	cout<<"\nwe should never get here in fate()!!!\n"<<endl;
	return 0;


}


//changed for acadlife
//neighbors is an array of virtual neighbors
//that need not be adjacent.  point.i and point.j contain actual location
//in world.  array[GEN][i][j] specifies index into neighbors.
//
//
inline int count_neighbor(neighlist neighbors[NUM_CELLS], int array[GEN+1][I][J], int i, int j,int gen){



	assert(gen<3);	//we don't want neigh index treated as a world
	//don't want any negatives
	int num=0;
	long int neighidx;
	neighlist current;
	int neighi, neighj;

	//new code for acadlife
	neighidx=array[GEN][i][j];
	for(int k=0;k<NEIGHBORS_PER_CELL;k++){
		neighi=neighbors[neighidx].list[k].i;
		neighj=neighbors[neighidx].list[k].j;

		num+=array[gen][neighi][neighj];		//later we'll have to make
										//sure we're not our own neighbor

	}




	/* code from classical life
	num=array[gen][((I+i+1)%I)][j]+array[gen][((I+i-1)%I)][j]	//W,E
		+array[gen][i][((J+j+1)%J)]+array[gen][i][((J+j-1)%J)] //N,S
		+array[gen][((I+i+1)%I)][((J+j+1)%J)]+array[gen][((I+i+1)%I)][((J+j-1)%J)]	//NE,SE
		+array[gen][((I+i-1)%I)][((J+j+1)%J)]+array[gen][((I+i-1)%I)][((J+j-1)%J)];

	*/

	return num;

}