-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGenetic.js
76 lines (63 loc) · 1.86 KB
/
Genetic.js
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
var generation = 1;
let tempPlayers = [];
var bestPlayerSoFar = null;
function getBestPlayer() {
let bestPlayer;
// get the best player from this generation
for (let i = 0; i < population; i++) {
if (!bestPlayer || players[i].score > bestPlayer.score) {
bestPlayer = players[i]; // find the player with the highest score
}
}
return bestPlayer;
}
function nextGeneration() {
let bestPlayer = getBestPlayer();
if (!bestPlayerSoFar || bestPlayer.score > bestPlayerSoFar.score) // we store the best player across all generations
bestPlayerSoFar = bestPlayer;
generation++; // increment the generation number
console.log("new generation: " + generation + " (best score: " + bestScore + ")");
tempPlayers = [];
for (let i = 0; i < population; i++) {
tempPlayers.push(players[i]);
}
calculateFitness();
for (let i = 0; i < population; i++) {
players[i] = pickOne();
}
}
function nextmanualGeneration() {
tempPlayers = [];
tempPlayers.push(players[1]);
for (let player of tempPlayers) {
player.fitness = player.score;
}
players[1] = pickOne();
}
function pickOne() {
var index = 0;
var r = random(1);
while (r > 0) {
r = r - tempPlayers[index].fitness;
index++;
}
index--;
let player = tempPlayers[index];
let child = new Player(generatePlayerX(), height - 64, player.brain);
child.mutate(0.1);
return child;
}
function regen(){
for (let i = 0; i < population; i++) {
players[i].alive = false;
}
}
function calculateFitness() {
let sum = 0;
for (let player of tempPlayers) {
sum += (player.score * player.score);
}
for (let player of tempPlayers) {
player.fitness = (player.score * player.score) / sum;
}
}