# A Generalization of the Chaos Game

@inproceedings{Bates2019AGO, title={A Generalization of the Chaos Game}, author={Tom Bates}, year={2019} }

The well-known “chaos game” algorithm for generating the Sierpinski gasket stochastically is generalized to any order of regular polygon. A simple formula is derived that gives a value, referred to as the “kissing number,” to produce a crisp analog to the Sierpinski triangle for any order of regular polygon. In addition, a second kissing number is revealed that produces another fractal for each polygon. Finally, some surprising aspects of the algorithm’s behavior are revealed, including that… CONTINUE READING