Beginners to LOGO programming may want to start by working through the FIRST FORWARD series of introductory articles before tackling this problem.
Below are some examples of recursion. I had been trying to replicate the spirals within the head of a sunflower!
![]() |
![]() |
![]() |
The program used was:
TO SUNF :S :A
FD :S RT :A
SUNF :S + 1 :A
END
You might like to replicate the spirals above by considering suitable values for the variables :S and :A.
The real challenge is to simulate the head of a sunflower with more spirals that are much more tightly packed and look distinctly more 'Fibonacci' in proportion!