Exhaustive testing provides an alternative algorithm for generating pre-images. The algorithm works by running the network forward by one step for each state in state-space, and keeping the 2n pairs of states (each state and its successor, exhaustive pairs) in memory. The list of exhaustive pairs can also be saved as a ``*.exh'' file. The pre-images of any state are found by scanning this list.
This method is efficient for basin of attraction fields, or large basins that use up a good proportion of state-space, and additionally is not sensitive to neighbourhood size, k. However the method is highly sensitive to increasing network size n.
If ``e'' is entered at the final prompt (#23.1-2), the following prompt is presented,
exhaustive pairs: load-l, compute-ret, and save-s: