Sierpinski 10D - Lindenmayer System
Game Introduction
https://en.wikipedia.org/wiki/L-system#Example_5:_Sierpinski_triangle * See my Sierpinski Triangle studio * https://scratch.mit.edu/studios/3560462
How To Play
Green Flag. (Turbo mode, <Shift> key + Green Flag, for much faster drawing). The Sierpinski Triangle is a triangle divided repeatedly into smaller triangles. There are many ways to create a Sierpinski Triangle. This method uses a Lindenmayer system (or "L-system"). A Lindenmayer system has an initial string and rules to produce the strings of following generations. This project is the same as "Sierpinski 10 - Lindenmayer" except that the start string only has the left side of the triangle. As the number of generations increases the right and bottom sides of the large triangle are approximated by the small triangles drawn. With the number of pixels on the Scratch stage these sides appear straight at the 9th generation. At the 9th generation , however, our Lindenmayer string exceeds the Scratch limit of 10,240 characters and only part of the triangle would be drawn. The sides appear straight at the 7th generation if you reduce the starting size from 360 to 120. The rules used here to produce the Sierpinski Triangle are: start string: F rules: F is replaced by F+G-F-G+F G is replaced by GG + is replaced by + - is replaced by - F and G both mean "draw forward" + means "turn clockwise 120 degrees" − means "turn anticlockwise 120 degrees"
Author
Scratch-Minion
Category
Game Information
Game Popularity
417 views
Collection Count
9 favorites
