Let's see.

Analysis: It was obvious from the outset that this was probably a binary sequence or at least could be seen as one. Then the question was what domain did it represent, and ultimately what object. This quickly turned out to be turtle graphics (familar since
basic school and much more recently with L-systems, personally speaking). Then in what order to read the bits (top-left to bottom-right; reverse; diagonal, etc. ). Then how to cluster the bits. The latest clues provided the obvious answer. Then the question
was what the concrete instruction set to map the bit pairs to. There are many possible instruction sets and many permutations. So first I tried a couple of permutations manually, then set out to do so more systematically by simply querying for all permutations
and switching through them.

Implementation: The first ideas was: do not simply provide a final answer, rather show the steps. So I thought I needed to have n steps where each step is represented as an image. C# 2.0 lazy iteraters are perfect for possibly infinite and lazy lists. This
was used to set up a pipeline of solutions or steps. Every solution is an image and the enumerator holds the current state of the pipeline where the button simply pushes the computation ahead until exhausted. The code is available in the thread I linked to.

The code is very hacky and does not deal correctly with disposables, but it's just a quick hack after all. The final solution was not nailed, but was enough to tell the text.

E-mail on the way.

See also -

http://en.wikipedia.org/wiki/Turtle_graphics

http://en.wikipedia.org/wiki/L-system

http://algorithmicbotany.org/