Watch the little bee buzz around the flower garden. Pay particular attention to how he picks up or drops off pollen (i.e., a single letter) at each flower.
— The little bee visits each flower exactly once
— The little bee can land on either the right side of the flower word or the left side of the flower word
— As he departs from the flower, the little bee can either leave pollen (i.e., a single letter) on the flower or take pollen (i.e., a single letter) from the flower.
— The flower must always show a valid English word before, during, and after the bee's visit
— The little bee never flies naked. He is always carrying some pollen (letters) with him. (Why? Because otherwise you won't get the triple word effect, with three different words on the flower before, during, and after the bee's visit.)
— The letters that the little bee carries do not need to be a word. He is flying too fast for anyone to read anyway!
Now it's a new season, with a new bloom of flowers. See if you can figure out which letters the little bee initially brings with him into the flower garden, and in which order he must visit the flowers.
In case you can't read the flowers:
BROWS DIVER EMISSION EMOTION ORATION RAILING REGAL REGIME SHREW SURGING TRAIN
no-computerstag! Even skillful developers would have a hard time with the algorithm for this as there are a lot of possibilities. $\endgroup$