Turtle L-system — rewrite axioms with F / + / − / [ / ]. Depth capped so segments stay well under 650. Distinct from binary recursive Tree.