I am playing with fractals, and drawing them with Python turtle
I am using this rules to create l-string for my koch fractal:
begin: f f -> f+f--f+f
In here, f means go forward by a fixed length,
- means turn right for 60 degrees,
+ means turn right for 60 degrees.
What I am trying to do is, calculate the value of fixed length in order for final fractal to have the same width, regardless of level of complexity of my fractal.
I can use length or the string or number of recursion that is used to create l-string.
I have tried dividing a fixed number with length of string or diving it for length of string to the power 3 (don't ask why, I just tried if it would work).
Bonus Points: Can you show me how to generalize the solution for other types of fractals?