powered by NetLogo
Basically we start with a turtle that marches forward one step. Then this hatches two turtles who march forward each one step but left and right orientated chosen randomly within limits. This gives two branches which in turn lead to four turtles being hatched, and the process continues. The sequence 1, 2, 4, 8, 16, 32, 64, 128, 264 gives none iterations and by then effectively you should stop the infinite Go loop. The branches of course contract a little as the growth continues just as the latest twigs on a tree are the smallest, and the youngest. Not much to experiment with here but try the options.