;;; Sierpinski curve from The New Turing Omnibus to zig :n ifelse :n=1 [ lt 90 fd 10 lt 90 fd 10 ][ zig :n/2 zag :n/2 zig :n/2 zag :n/2 ] end to zag :n ifelse :n=1 [ rt 90 fd 10 rt 90 fd 10 lt 90 fd 10 ][ zag :n/2 zag :n/2 zig :n/2 zag :n/2 ] end to omnibus :n home clean zig :n zig :n end ;;; Sierpinski triangle based on the L-System ;;; Start: A, Rules: (A -> B-A-B), (B -> A+B+A) to A :n :d ifelse :n=0 [ fd :d ][ B :n-1 :d rt 60 A :n-1 :d rt 60 B :n-1 :d ] end to B :n :d ifelse :n=0 [ fd :d ][ A :n-1 :d lt 60 B :n-1 :d lt 60 A :n-1 :d ] end to triangle :n :d home clean A :n :d end