Next: Evaluation of the resulting
Up: Project wigout
Previous: Creating variable sequences for
Currently, one algorithm for transformation is proposed. Upon each
iteration of the state:
- if a variable has an increment that is
non-zero, that variable will change its magnitude by that increment.
- if a variable of a segment has an increment that is zero,
that variable will repeat its magnitude.
Every variable within a segment is given an initial value, minimum and
maximum limits, and an increment. Thus, every variable that has a
non-zero increment has a cycle length of:

After cycles number of iterations, the variable returns to
its initial magnitude.
This suggests possibilities of experimentation with
concomitant cycles that:
- have the same length, but different minima and maxima.
- have different lengths, but the same minima and maxima.
- have lengths that are integer multiples of each other, i.e.,
that follow the harmonic series.
- have lengths that are relatively prime.
To be explored is application of the above criteria
simultaneously to all segments within a state, and to all variables within
each segment.
Next: Evaluation of the resulting
Up: Project wigout
Previous: Creating variable sequences for
Arun Chandra
arunc@evergreen.edu