  This note explores state space search to find efficient instruction sequences
that perform particular data manipulations. Once found, the instruction
sequences are hard-wired in the code generator that needs these data
manipulations. Since state space is only searched while developing the
compiler, search time is not at a premium, which allows exhaustively searching
for the best possible instruction sequences.
