|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.ObjectCPA
This is the cellular programming algorithm (CPA) of density task very similar
to Moshe Sipper's.
Cellular automata (CA) is 1 dimensional, has 2 states, and is non-uniform.
Each cell has 3 neighbours (one left, itself, and one right). Initial rules
are random, CAs are also random. Rules are 8 bits long. Spatially periodic
boundary conditions are applied.
Field Summary | |
private static int |
CELL_NUM
Number of cells. |
private static int |
GENERATION_NUM
Number of generations. |
private static double |
MUTATION_PROBABILITY
Rule mutation probability. |
private static int |
START_CONFIG_NUM
Number of start configurations. |
private static int |
STEP_NUM
Number od execution steps. |
Constructor Summary | |
CPA()
|
Method Summary | |
static void |
main(java.lang.String[] args)
Start method. |
void |
run()
Runs the CPA. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
private static final int CELL_NUM
private static final int STEP_NUM
private static final int START_CONFIG_NUM
private static final int GENERATION_NUM
private static double MUTATION_PROBABILITY
Constructor Detail |
public CPA()
Method Detail |
public static void main(java.lang.String[] args)
args
- the command line arguments (not used).public void run()
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |