Unexpected complexity from a simple algorithm

I had an unexpected complexity result from a sphere surface node spacing algorithm when the move factor multiplicative parameter was entered incorrectly. An expected value of 1.001 was inadvertently replaced with -0.4942857851. Instead of generating a semi-uniform spacing of nodes as expected, a complex, dynamical interaction resulted as seen in this short video. The only task of the short and simple algorithm is to take a random distribution of nodes on a sphere and space them in a semi-uniform configuration. There are no rules as in a cellular automation system so the degree of complexity was surprising. The system is fully deterministic and repeatable when a seed value is used for the initial random distribution of nodes.