Em Grasmeder
Em Grasmeder
I don't know exactly how we'll do it, but right now the trees are made with terminals that are exclusively constants. This works for guessing a number, but doesn't allow...
There should be an option to cease the program when a certain success predicate is reached, for example a tree with a perfect score
Add capability to write population, functions, terminals, etc (so, I guess the entire state?) to JSON (or something) and load later.
Encapsulation works in the following way: 1. Select a tree (with probability proportional to fitness) 2. Choose random point between depth(0) and depth(N) 3. Using that point as a root...
Editing works by recursively replacing pure functions with the values they evaluate to. This can be done during the evolution process to reduce computational complexity, or after a best candidate...
Instead of having `setters/dec-generations`,`setters/dec-current-tree-depth`, `setters/dec-seeds-remaining`, etc... we can have a function like `(dec-attribute :generations)`, `(dec-attribute :current-tree-depth)`, etc. It could even take multiple keys.
Koza identifies 19 parameters that can be varied for different efficacy / efficiency in genetic programming (including population size, tree depth, etc). Let's set some defaults for any that we...
The enhancement on the table is to use Koza's "ramped half and half" algorithm to create trees. - A "full" tree is a tree such that every path has a...
As a pipeline status moves from `initializing` to `running` to `completed` or `failed` etc., the timestamp of the change should be recorded so that we can fetch them from the...