When universal cycles of this type are decoded, the resulting order of strings (e.g. $1233, 2331, 3312, ..., 2313, 3123$) have a nice property: Successive strings differ by a prefix rotation of length $n$ or $n-1$. We illustrate how this property can be used to speed-up exhaustive computations for the stacker crane problem, and other combinatorial problems whose candidate solutions can be represented by fixed-content strings. \newline
Joint work with Joe Sawada (University of Guelph).