Even with only 9 gates we have 512 possible states of the network. Choosing the attractor option plots a box for each state entered and a line connecting them. In this way a map of the attractor basin can be plotted and the attractor cycle identified. Options are available to start from any state, to colour cycle the attractor and to delay the state changes for visibility. The display includes the binary and decimal current state and last initial state.
Perturbations change the state values, and any desired output state can be specified directly.
Mutation of gates is allowed and automatic initial state perturbations can be selected. Update mode is normally synchronous, but can be switched to probabilistic allowing asynchronous and semi-synchronous modes to be simulated to investigate transient attractors. An addition to the Attract program, based on the same 3x3 matrix. This program analyses all 512 initial states of the network and displays a coded picture of all the attractors present in the network with their lengths and minimum states. This allows the arrangement of attractors and their relationship to gate outputs to be visualised, showing the effect of each of the gates on the relevant attractors.