A pattern that shows up everywhere in chaos and fractal theory.
This page shows what happens when you draw points at “random”. That is, there is a random element, but the overall result is very patterned. The basic idea is that you click the buttons, below the box, in order from top to bottom.
What you are doing each time you click a button is iterating a function. What that means is just repeating it, each time plugging in the last output into the new input. This is a kind of recursion. The sequence of points is called an orbit. Depending on the rule you use for the function, the orbit can go in all sorts of ways. Michael Barnsley first explored this, and called it the chaos game.
The usual way to get a picture of the Sierpiński triangle is to start with a large equilateral triangle, and remove a smaller triangle from the middle. Then do the same thing with the smaller remaining triangles. And then again with the remaining ones, etc.
The set of points you get when you have done this an infinite number of times (yes, that’s a tricky issue, that infinity) is called the Sierpiński triangle, after the Polish mathematician Wacław Sierpiński who investigated it in 1915.
This set is an attractor for the function we are iterating on this page: the “Go halfway to A, B, or C” function. That means that no matter where we start, the orbit of points always gets closer and closer to the set. So close that, as far as the computer image can render, we are actually on it. Now, why that should be, or more generally how to find the attractors for arbitrary functions, is a big and deep topic!