Imagine you are an artist trying to draw a realistic tree. It's incredibly hard, right? A tree has thousands of branches, and drawing each one by hand takes forever. But if you look closely at a fern, a tree, or even the branching of your own blood vessels, you will notice a fascinating pattern: the parts look very much like the whole. A small branch of a tree resembles a smaller version of the entire tree. This property is known as self-similarity.

In 1968, a Hungarian theoretical biologist named Aristid Lindenmayer invented a formal grammar to model this very phenomenon. His invention, now called L-Systems (or Lindenmayer Systems), is a mathematical way of describing the complex growth of plants using incredibly simple rules. Instead of drawing the tree manually, what if you could write down a simple set of instructions and have a computer follow those rules to grow the tree for you?

How L-Systems Work

At its core, an L-System is a string-rewriting system. It's like playing a game of search-and-replace with letters. It starts with an initial string of characters, called the axiom. Then, it applies a set of rules to replace each character in the string with a new string. This process is repeated over and over again, in steps called iterations.

Let's look at a simple example: algae growth. Imagine algae consists of two types of cells, A and B. When cell A divides, it becomes a new cell A and a cell B (so A becomes AB). When cell B matures, it simply turns into cell A (so B becomes A).

• Variables: A, B
• Axiom (The Start): A
• Rules: A → AB, B → A

Let's trace the first few iterations:

• Iteration 0: A (We start with one cell A)
• Iteration 1: AB (The A became AB)
• Iteration 2: ABA (The A became AB, the B became A)
• Iteration 3: ABAAB
• Iteration 4: ABAABABA

What started as a single character quickly grows into a complex sequence, following a predictable but non-obvious pattern. If you count the lengths of these strings (1, 2, 3, 5, 8...), they follow the famous Fibonacci sequence!

From Strings to Shapes: Turtle Graphics

Strings are interesting, but L-Systems truly come alive when we turn those strings into drawings. We do this using something called Turtle Graphics.

Imagine a mechanical turtle sitting on a piece of paper, holding a pen. The characters in our L-System string become commands for the turtle:

• F : Move forward and draw a line (draw a branch).
• + : Turn right by a certain angle.
• - : Turn left by a certain angle.
• [ : Save the current position and angle (remember where you are).
• ] : Return to the last saved position and angle (go back to where you were).

Drawing a Fractal Plant

The brackets ([ and ]) are the secret to drawing plants. They act like branches on a tree. When the turtle sees a [, it remembers its spot. It then goes off and draws a branch. When it hits a ], it magically teleports back to the spot it remembered, ready to draw another branch in a different direction. This allows the turtle to draw complex, splitting structures without having to retrace its steps.

Using these simple commands, we can create astonishingly complex shapes, such as the Koch snowflake, the Dragon curve, or incredibly realistic-looking fractal trees. The beauty of L-Systems lies in this emergent complexity: complex, natural-looking structures arising from very simple, repetitive rules. It turns out that nature is a master coder, using very basic instructions to create all the wonderful shapes we see in the woods!

You can try creating your own fractal plants, Koch curves, and dragon curves using simple replacement rules in Experiment 01.