void destination(int i)
{

	//calculate the destination for array member(soldier) i
	//15 away from closest enemy	
	
	int count1;
	double distance_lowest = 100.00;
	double distance;
	//double slope;
	//double y-intercept;
	//double x-intercept;
	//double radius;	double X1, X2, Y1, Y2;

	for(count1 = 0; count1 < 18; count1++) {
	
		if(soldier[i].team != soldier[count1].team ) {
			
			distance = sqrt( ((soldier[i].X - soldier[count1].X)*(soldier[i].X - soldier[count1].X)) + ((soldier[i].Y - soldier[count1].Y)*(soldier[i].Y - soldier[count1].Y)) );
			distance = distance - 1;
			if(distance_lowest > distance) {

				if(soldier[i].X > soldier[count1].X) {
					soldier[i].destX = soldier[count1].X + sqrt(distance);
				}else{
					soldier[i].destX = soldier[count1].X - sqrt(distance);
				}
				
				if(soldier[i].Y > soldier[count1].Y) {
					soldier[i].destY = soldier[count1].Y + sqrt(distance);
				}else{
					soldier[i].destY = soldier[count1].Y - sqrt(distance);
				}


				distance_lowest = distance;
			}		
		}
	}


}