summaryrefslogtreecommitdiff
path: root/src (follow)
AgeCommit message (Collapse)Author
2019-08-08More features.HEADmainMike Buland
2019-08-08Added more features to the simulation.Mike Buland
2012-08-05Added I/O test for binary phenotypes.Mike Buland
2012-08-05Added option to recalculate survivors.Mike Buland
This accomidates simulations where the test conditions can change as the simulation runs, which would effect the scores of phenotypes that have already been tested.
2012-08-04Made some changes to make serializing workable.Mike Buland
There's no official format yet, but that's coming, most likely.
2012-08-04Optomized the mating / mutation setup.Mike Buland
It should work the same, but it selects the number of bits to mutate first, then selects the individual bits instead of testing a random number on each bit. For very large phenotypes this will be significantly faster while producing about the same result.
2012-08-02New commit methodMike Buland
2012-07-18Persistant multi-threading works perfectly.Mike Buland
It uses the forever-blocking variation of the Bu::SynchroQueue dequeue to maximize efficiency.
2012-07-17It all works multi-threaded.Mike Buland
It restarts the threads every generation. Maybe not the worst thing every, but it seems like it would be better to stay in the thread and notify the main thread that they're done with that iteration.
2012-07-09Simple saving/loading - consider this temporary.Mike Buland
It should be a little more compact, and have more header info so we can reconstruct the entire object from the file, right now you have to know the size in bits.
2012-07-09Just played with the parameters.Mike Buland
2012-07-09It works well enough to solve polynomial maxima.Mike Buland
2012-07-09New libgenetic. Genetic algorithms, only good.Mike Buland