#include<stdio.h>
#include<stdlib.h>

int fitness(bool* chromosome);

int main()
{
	int i,j,g;	//counters
	int population=10;
	bool chromosome[10][7];	//population

	//initializing population
	for(i=0;i<population;i++)
	{
		for(j=0;j<7;j++)
		{
			//randomize the chromosome 
			chromosome[i][j]=rand()%2;			
			

		}
	}
	
	for(g=0;g<100;g++)
	{
		printf("generation %d\n",g);
		
		
		//Evaluation
		int best=0;	//will store the index for the best in the population

		for(i=1;i<population;i++)
		{
			if(fitness(chromosome[best])<fitness(chromosome[i]))
				best=i;	
		}
		
		//Reproduction
		for(i=0;i<population;i++)
		{
			//to not reproduct with itself
			//it would be a waste of time 
			//(although this if could introduce a break in the pipeline, well.. forget about this)
			if(i!=best)
			{
				for(j=0;j<7;j++)
				{
					//either the gene will be kept the same or it will be changed
					//to be what the best chromosome has
					if(rand()%2)
						chromosome[i][j]=chromosome[best][j];			
					else
						chromosome[i][j]=chromosome[i][j];			

					//mutation	
					if(rand()%100<4)
						chromosome[i][j]=rand()%2;			
						
				}
							
			}	
		}

		printf("best fitness %d\n",fitness(chromosome[best]));

	}


	return 0;
}

int fitness(bool* chromosome)
{
	// the ingredients are:  0     1     2     3   4    5     6
	// 			salt sugar lemon egg water onion apple
	return ( -chromosome[0] + chromosome[1] + chromosome[2]	
		 -chromosome[3] + chromosome[4] - chromosome[5]	
		 -chromosome[6] );	
}