The twist is that the computations are handled server-side, using DWScript JIT compiler, so exploration can be fairly fast and comfortable even on low-powered hardware, be it an iPad, a Smartphone or an old laptop.
Part 1 left us with a large cryptic looking string (a recursively applied grammar applied to an axiom, for the purists).
In part 2 we’ll go from that big string to a visual representation, by making use of that string as a set of commands for a turtle language.
For more details, read the turtle graphics article in wikipedia, it’s (at the moment) short and to the point.
The class of grammar-based fractals known as Lindenmayer system allows generating an interesting variety of geometrical and botanical visuals.
To the right is a representation of a “Fractal Plant”, which is generated from just two simple (if cryptic-looking) rules applied recursively.
In simple terms, L-System starts from a string (called an axiom), to which rules are applied recursively. Rules are a set of substitution strings for characters in the original string.