| 3 | | * ~~SymbolicExpressionTreeProblem~~ |
| 4 | | * ~~HeuristicLab.GP.Problems~~ |
| 5 | | * ~~ArtificialAnt~~ |
| 6 | | * reduction from 12 to 3 classes is pretty cool |
| 7 | | * achieves exactly the same results as before |
| 8 | | * same performance as before |
| 9 | | * ~~BasicSymbolicRegression~~ |
| 10 | | * Recreates constants every time the problem is changed => not reproducible |
| 11 | | * Couldn't the solution be transformed to a standard data analysis tree (simplify, optimize) |
| 12 | | * Return type of CreateEvalClosure is horrible |
| 13 | | * {{{Func<ISymbolicExpressionTreeNode, ISymbolicExpressionTreeNode, Func<double, double, double>, IEnumerable<double>>}}} |
| 14 | | * ~~Boolean~~ |
| 15 | | * Why are the boolean problems restricted and why is this done in the evaluation function? |
| 16 | | * ~~LawnMower~~ |
| 17 | | * ~~UnitTests~~ |
| 18 | | * ~~Samples~~ |
| | 5 | * BasicSymbolicRegression |
| | 6 | * Recreates constants every time the problem is changed => not reproducible |
| | 7 | * Couldn't the solution be transformed to a standard data analysis tree (simplify, optimize? |
| | 8 | * Why are the boolean problems restricted (number of bits) and why is this done in the evaluation function? |
| | 9 | |
| | 10 | |
| | 11 | Overall pretty cool and easy to implement problems. I am especially impressed on how easy tree evaluation can be performed for the boolean and regression problems. |
