# chaos game
The chaos game is a deceptively simple algorithm: pick a random starting point, repeatedly jump a fraction of the way toward a randomly chosen vertex of a polygon, and plot every point you land on. Do that enough times and, instead of noise, an intricate fractal emerges — proof that pure randomness can produce highly ordered structure. The Chaos Game simulation lets you run that exact process yourself, while Sierpiński Triangle shows the most famous result of the three-vertex version. Barnsley Fern swaps the polygon for a set of affine transformations to grow a strikingly plant-like fractal by the same random-iteration principle, and IFS Fractals — Iterated Function Systems generalizes the idea to arbitrary transformation sets. The companion article, IFS: Iterated Function Systems and Fractal Attractors, explains the underlying math behind all four.
Found: 4 simulations · 1 articles
🧪 Simulations (4)
📖 Articles (1)
Facts about this collection
- This tag has 4 simulations and 1 article — the only chaos-game tag page in this batch with a companion article.
- Sierpiński Triangle is the direct output of running the Chaos Game simulation with three vertices.
- Barnsley Fern is one of the best-known examples of an iterated function system (IFS) producing a natural-looking shape from pure randomness.
- IFS Fractals — Iterated Function Systems generalizes the chaos-game idea beyond triangles, and the linked article covers the theory behind IFS attractors.
Simulations in this topic include Sierpiński Triangle, Barnsley Fern, Chaos Game, IFS Fractals — Iterated Function Systems and IFS: Iterated Function Systems and Fractal Attractors.
Looking for more? Dive into the full library of 1000+ interactive, browser-based simulations, or browse every topic.