TEST these source codes

Question

I need help with this source code please some one could give me some direction. I could not figured out what i'm missing please.
import java.util.Random;
public class Candidate
  private int x;
  private int y;
  private int chromosome[];
  private double fitness;
  public  final static int MAXGENES = 64;
  private static Random myRandom = new Random(10);
  public Candidate()
      x=myRandom.nextInt(100);
       y=myRandom.nextInt(100);
       chromosome = new int[MAXGENES];
       GeneticToolsApp.determineFitness(this);
       makeChromosome();
     } //end of default constructor
  public Candidate(int myX, int myY)
      x=myX;
       y=myY;
       chromosome = new int[MAXGENES];
       GeneticToolsApp.determineFitness(this);
       makeChromosome();
     } //end of constructor
  public void makeChromosome()
      String tempA;
       String tempB;
       String combined;
       tempA = Integer.toBinaryString(x);
       //now pad the leading zeros
       for(int i = tempA.length(); i < MAXGENES/2;i++)
          tempA = "0"+tempA;
       tempB = Integer.toBinaryString(y);
       for(int i = tempB.length(); i < MAXGENES/2;i++)
          tempB = "0"+tempB;
       String combinedResult = tempA +"-"+ tempB; 
       combined = tempA +tempB;
      for(int i=0;i<combined.length();i++)
          chromosome[i] = combined.charAt(i)-'0';
     } //end of makeChromosome
public void displayCoordinates()
      String resultStringA,resultStringB,resultString;
       resultStringA = "";
       resultStringB = "";
       resultString  = "";
       int resultA;
       int resultB;
       for(int i=0;i<chromosome.length/2;i++)
          resultStringA += chromosome;
     resultA = Integer.parseInt(resultStringA,2);
     for(int i=chromosome.length/2;i<chromosome.length;i++)
resultStringB += chromosome[i];
     resultB = Integer.parseInt(resultStringB,2);
     resultString += "("+resultA+","+resultB+")";
     System.out.println("coordinates = "+resultString);
     x = resultA;
     y = resultB;
     } //end of displayCoordinates
public void flipBit(int randomPosition)
if(randomPosition != 0 && randomPosition != MAXGENES/2) //dont make coordinate neg
          if (chromosome[randomPosition] == 1)
               chromosome[randomPosition] = 0;
          else
               chromosome[randomPosition] = 1;
     updateCoordinates(); //use the chromosome array to update x,y
     } //end of flipBit
//this method will analyze the new chromosome and reset the x and y
public void updateCoordinates()
String resultStringA,resultStringB,resultString;
     resultStringA = "";
     resultStringB = "";
     resultString = "";
     int resultA;
     int resultB;
     for(int i=0;i<chromosome.length/2;i++)
resultStringA += chromosome[i];
     resultA = Integer.parseInt(resultStringA,2);
     for(int i=chromosome.length/2;i<chromosome.length;i++)
resultStringB += chromosome[i];
     resultB = Integer.parseInt(resultStringB,2);
     resultString += "("+resultA+","+resultB+")";
     // System.out.println("coordinates = "+resultString);
     x = resultA;
     y = resultB;
     } //end of updateCoordinates
public void setX(int myX)
x = myX;
public void setY(int myY)
y = myY;
public int getX()
return(x);
public int getY()
return(y);
public int[] getChromosome()
return(chromosome);
public void setFitness(double myFitness)
fitness = myFitness;
public double getFitness()
return(fitness);
public String displayCandidateInfo()
String retval;
retval="";
     retval += "("+x+","+y+") "+ "fitness = "+fitness;
     return(retval);
} //end of class definition

Answer 1

import java.util.Random;
public class GeneticToolsApp {
    private static Random myRandom = new Random(10);
    public static void determineFitness(Candidate myCandidate) {
        double fitnessResult;
        fitnessResult = 0.0; //initial value to overwrite
        myCandidate.setFitness(fitnessResult);
    //selection
    public static void selection(Candidate populationList[]) {
        Candidate newPopulationList[];
        newPopulationList = new Candidate[populationList.length];
        //sum up all the fitnesses
        int percentages[];
        percentages = new int[populationList.length];
        double sum;
        sum = 0.0;
        for(int i=0;i<populationList.length;i++) {
            sum += populationList.getFitness();
//determined percentages for next recombination
for(int i=0;i<populationList.length;i++) {
//how many of each to put back into the population
percentages[i] =(int) Math.ceil(((populationList[i].getFitness() / sum)
* populationList.length));
int countSum;
countSum=0;
for(int i=0;i<percentages.length;i++) {
countSum += percentages[i];
if ( (populationList.length - countSum) > 0) //not creating enough
//just add it to the strongest candidate to date
percentages[0] += (populationList.length - countSum);
if ((populationList.length - countSum) < 0) //toomany
for(int i=0;i<countSum-populationList.length;i++) {
if (percentages[i]>0) {
percentages[i]--;
countSum=0;
for(int i=0;i<percentages.length;i++) {
countSum += percentages[i];
//create new PopulationList for recombination
//for each percentage>0 insert that candidate that many time into the new list
int newListIndex = 0;
for(int i=0; i<percentages.length;i++) {
for(int j=0;j<percentages[i];j++) {
newPopulationList[newListIndex] = populationList[i];
newListIndex++;
//populationList = newPopulationList; //wont work, pass by value
//insert new population back into the old population list
for(int i=0;i<populationList.length;i++) {
populationList[i] = newPopulationList[i];
} //end of selection
public static void recombination(Candidate populationList[], int mutationRate) {
Candidate newOffspringList[] = new Candidate[populationList.length+1];
Candidate offspring;
int parentA;
int parentB;
for(int i=0;i<populationList.length;i++) {
//randomly pick two unique from top halfto "mate"
} //end of for loop to create new kiddies
//see if the "best parent is more fit than the kids
insertCandidate(newOffspringList,populationList[0],populationList.length);
//create the same number of offspring as parents putting them back into the populationList
for(int i=0;i<populationList.length;i++) {
populationList[i] = newOffspringList[i];
} //end of recombination
//recombination
public static void mutation(Candidate myCandidate, int mutationThreshold) {
int currentRandomMutation;
int randomPosition;
currentRandomMutation = myRandom.nextInt(100);
} //end of mutation
* @param candidateA
* @param candidateB
* @return
public static Candidate crossover(Candidate candidateA, Candidate candidateB) {
Candidate newCandidate;
newCandidate = new Candidate();
int crossoverPoint;
return(newCandidate);
} //end of crossover
// insert the candidates into the list sorted by fitness
public static void insertCandidate(Candidate populationList[],
Candidate currentCandidate, int size) {
} //end of insertCandidate
public static String displayCurrentPopulation(Candidate populationList[]) {
String retval;
retval = "\n";
return(retval);
} //end of GeneticTools