|
Evolving Strategies for the Prisoner's Dilemma | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Object | +--ie.errity.pd.genetic.Genetic
Provides Genetic operations
| Constructor Summary | |
Genetic()
|
|
| Method Summary | |
static java.util.BitSet[] |
crossover(java.util.BitSet parenta,
java.util.BitSet parentb)
Mate two parents using random, one point crossover |
static java.util.BitSet |
mutate(java.util.BitSet original,
double mProb)
Mutate (Flip a bit in the bitset) with probability mProb |
static int[][] |
scale(int[][] curPop)
Linear fitness scaling of a 2D array |
static int[] |
scale(Prisoner[] curPopulation)
Linear fitness scaling of an array of Prisoners
Based on the Prisoner's Scores |
static int[][] |
scale(Prisoner[][] curPop)
Linear fitness scaling of a 2D array of Prisoners
Based on the Prisoner's Scores |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public Genetic()
| Method Detail |
public static java.util.BitSet[] crossover(java.util.BitSet parenta,
java.util.BitSet parentb)
parenta - first parent (BitSet representation)parentb - second parent (BitSet representation)
BitSet
representation)
public static java.util.BitSet mutate(java.util.BitSet original,
double mProb)
original - the entity to be mutatedmProb - the probability of a bit being mutated
public static int[] scale(Prisoner[] curPopulation)
Prisoners
Prisoner's Scores
curPopulation - the array of Prisoners
to be scaled
public static int[][] scale(Prisoner[][] curPop)
Prisoners
Prisoner's Scores
curPop - the array of Prisoners
to be scaled
public static int[][] scale(int[][] curPop)
curPop - the array to be scaled
|
Andrew Errity [99086921] | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||