Use a genetic algorithm to evolve populations of bit strings.
Go to file
2018-04-14 00:33:36 -07:00
Breeder.cpp First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Breeder.h First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Chromosome.cpp Add Error functions to mirror/inverse fitness logic 2018-04-14 00:33:36 -07:00
Chromosome.h Add Error functions to mirror/inverse fitness logic 2018-04-14 00:33:36 -07:00
Defines.h First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Enums.h First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
ForwardDeclarations.h First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Includes.h First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Makefile First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Population.cpp Centralize thread count suggestion 2018-04-14 00:28:50 -07:00
Population.h Centralize thread count suggestion 2018-04-14 00:28:50 -07:00
Random.cpp First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00
Random.h First commit - Seems to pass "all 1's" evolution test 2018-04-13 23:59:20 -07:00