-
Notifications
You must be signed in to change notification settings - Fork 7
/
FavourableWeightedBreedingAlgorithm.java
84 lines (69 loc) · 2.8 KB
/
FavourableWeightedBreedingAlgorithm.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// Copyright 2021 The Terasology Foundation
// SPDX-License-Identifier: Apache-2.0
package org.terasology.genome.breed;
import org.terasology.engine.utilities.random.FastRandom;
public class FavourableWeightedBreedingAlgorithm implements BreedingAlgorithm {
private int minimumCrossSimilarity;
private float mutationChance;
private float weight;
public FavourableWeightedBreedingAlgorithm(int minimumCrossSimilarity, float weight) {
this.minimumCrossSimilarity = minimumCrossSimilarity;
this.mutationChance = mutationChance;
this.weight = weight;
}
/**
* Check whether two organisms with the given genes can breed.
*
* @param genes1 The genes of the first organism
* @param genes2 T he genes of the second organism
* @return Whether the two organisms can breed
*/
@Override
public boolean canCross(String genes1, String genes2) {
validateGenes(genes1, genes2);
int genomeLength = genes1.length();
int sameGenesCount = 0;
char[] chars1 = genes1.toCharArray();
char[] chars2 = genes2.toCharArray();
for (int i = 0; i < genomeLength; i++) {
if (chars1[i] == chars2[i]) {
sameGenesCount++;
}
}
return sameGenesCount >= minimumCrossSimilarity;
}
/**
* Produces the genes of an offspring from parent organisms with the genes specified.
*
* @param genes1 The genes of the first parent organism
* @param genes2 The genes of the second parent organism
* @return The genes of an offspring from the two parent organisms
*/
@Override
public String produceCross(String genes1, String genes2) {
if (!canCross(genes1, genes2)) {
return null;
}
int genomeLength = genes1.length();
FastRandom rand = new FastRandom();
StringBuilder result = new StringBuilder(genomeLength);
char[] chars1 = genes1.toCharArray();
char[] chars2 = genes2.toCharArray();
for (int i = 0; i < genomeLength; i++) {
if (rand.nextInt(100) < (int) (weight * 100)) {
// Choose the character with the greater ASCII value.
result.append((int) chars1[i] >= (int) chars2[i] ? chars1[i] : chars2[i]);
} else {
// Choose the character with the lower ASCII value.
result.append((int) chars1[i] >= (int) chars2[i] ? chars2[i] : chars1[i]);
}
}
// TODO: Implement mutation?
return result.toString();
}
private void validateGenes(String genes1, String genes2) {
if (genes1 == null || genes2 == null || genes1.length() != genes2.length()) {
throw new IllegalArgumentException("Genomes not defined or of incorrect length");
}
}
}