We've just started programming at uni. One of our tasks is to create a fractal tree with the L-system with a turtle in python. This one:
1. variables : X F
2. constants : + − [ ]
3. start : X
4. rules : (X → F-[[X]+X]+F[+FX]-X), (F → FF)
5. angle : 25°
Code:
def fraktal_plante(padde, depth):
Xmerke(padde, depth-1) # X
def Xmerke(padde, depth):
if depth > 0:# X ->
padde.forward(10) # F
padde.right(25) # -
padde.setposition()
padde.setheading() # [
padde.setheading() # [
Xmerke(padde, depth-1) # X
padde.heading()
padde.goto() # ]
padde.left(25) # +
Xmerke(padde, depth-1) # X
padde.heading() # ]
padde.left(25) # +
padde.forward(10) # F
padde.setposition()
padde.setheading() # [
padde.left(25) # +
padde.forward(10) # F
Xmerke(padde, depth-1) # X
padde.heading()
padde.goto() # ]
padde.right(25) # -
Xmerke(padde, depth-1) # X
def Fmerke (padde, depth):
if depth > 0: # Y ->
padde.forward(10) # F
padde.forward(10) # F
As you can see it's messy. I am wondering how to make the turtle remember its position and heading " [ " for then to return to it afterwards " ] ".
I am really new to this so please answer in a clear and easy way to understand.