Turbo Mode, or run here: https://turbowarp.org/552262240/fullscreen?hqpen&turbo I realized, from @CatIsFluffy, that the chaos game method can be used for generating any IFS; by applying a probability to choose between a number of affine transformations, you can create each infinite combination of those transformations. I applied that theory here to create the sierpinski carpet, as well as a variation proposed by CatIsFluffy where the squares inside are rotated at each iteration level. Since every possible path here has the same amount of scaling in unit "area" when the transformation is applied, we do not have to weight the probabilities by those areas (since a larger area should have more samples, and therefore have a higher probability of being chosen). I think you can also apply this to a non-affine transformation, as long as you are able to weight the samples accordingly (given by the Jacobian determinant, since the Jacobian matrix gives the linear transformation that a point in space tends to as your frame of reference approaches an infinitesimal size, and the determinant of a matrix is the ratio change in area that applying that matrix as a linear transformation would cause: https://en.wikipedia.org/wiki/Jacobian_matrix_and_determinant).
