public class RoyalTree extends GPProblem implements SimpleProblemForm
Parameters
| base.data classname, inherits or == ec.app.royaltree.RoyalTreeData |
(the class for the prototypical GPData object for the RoyalTree problem) |
Parameter bases
| base.data | species (the GPData object) |
| Modifier and Type | Field and Description |
|---|---|
(package private) char[] |
successors |
| Constructor and Description |
|---|
RoyalTree() |
| Modifier and Type | Method and Description |
|---|---|
void |
evaluate(EvolutionState state,
Individual ind,
int subpopulation,
int threadnum)
Evaluates the individual in ind, if necessary (perhaps
not evaluating them if their evaluated flags are true),
and sets their fitness appropriately.
|
(package private) double |
fitness(GPNode node,
EvolutionState state) |
(package private) boolean |
isPerfect(char parent,
GPNode node,
EvolutionState state)
Calculate whether the tree rooted at n is a perfect subtree
of the appropriate type given the current parent.
|
(package private) boolean |
isSuccessor(char p,
char q,
EvolutionState state) |
clone, defaultBase, setupcanEvaluate, closeContacts, describe, describe, finishEvaluating, initializeContacts, prepareToEvaluate, reinitializeContactsequals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitdescribepublic void evaluate(EvolutionState state, Individual ind, int subpopulation, int threadnum)
SimpleProblemFormevaluate in interface SimpleProblemFormdouble fitness(GPNode node, EvolutionState state)
boolean isSuccessor(char p,
char q,
EvolutionState state)
p - parentq - childboolean isPerfect(char parent,
GPNode node,
EvolutionState state)
parent - n - root of the sub-tree to be tested.Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.