george/genetic-algorithm
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add todos

Browse Source
This commit is contained in:
George Lacey 2017-09-29 17:49:13 +01:00
parent c4bed833cc
commit eac58f519f
2 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/main.py
View File

@ -24,7 +24,8 @@ for i in range(0, args.iter):
print("Epoch: %d " % i) print("Epoch: %d " % i)
pop.advance_generation() pop.advance_generation()
best = pop.best_fitness() best = pop.best_fitness()
best_fit.append(pop.best_fitness().fitness()) best_fit.append(pop.avg_fitness())
#input("...")
sleep(args.wait) sleep(args.wait)
plt.plot(best_fit) plt.plot(best_fit)

5
src/population.py
View File

@ -52,6 +52,7 @@ class Population(object):
for member in self.members: for member in self.members:
position -= member.fitness() / divisor position -= member.fitness() / divisor
if position <= 0: if position <= 0:
#print(member)
return member return member
def mutate(self, chance): def mutate(self, chance):
@ -60,6 +61,8 @@ class Population(object):
member.mutate() member.mutate()
def advance_generation(self): def advance_generation(self):
# todo: elitism
# todo: don't crossover all
self.fitness_function() self.fitness_function()
parents = list() parents = list()
for i in range(0, len(self.members)): for i in range(0, len(self.members)):
@ -71,4 +74,4 @@ class Population(object):
children.append(one) children.append(one)
children.append(two) children.append(two)
self.members = children self.members = children
self.mutate(5) self.mutate(2)