next up previous
Next: Evaluation of the resulting Up: Project wigout Previous: Creating variable sequences for

Specifying the transformations

Currently, one algorithm for transformation is proposed. Upon each iteration of the state:

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:

\begin{displaymath}
cycles~=~{{2\,\left( {\it max} - {\it min} \right) }\over {{\it increment}}}\end{displaymath}

After cycles number of iterations, the variable returns to its initial magnitude.

This suggests possibilities of experimentation with concomitant cycles that:

To be explored is application of the above criteria simultaneously to all segments within a state, and to all variables within each segment.


next up previous
Next: Evaluation of the resulting Up: Project wigout Previous: Creating variable sequences for
Arun Chandra
arunc@evergreen.edu