>>I use an algorithm that manipulate monads.
>>
>>I begin with 50+ randomly placed monads.
>>
>>They always seem to break into groups of two.
>>
>>The rules, the initial conditions, and some of the results I've gotten are accessible here:
>>
>>
http://cloudmusiccompany.com/science/research.htm >>
>>My question is, why do the monads split into clusters of two?
>
>My gut reaction is that it's a byproduct of VFP's implementation of RAND. It would be interesting to see this redone with a cryptographic random number (which should normally be evenly distributed on a graph if it's truly random) vs. VFP's version.
I tested VFP's RAND() a while back, it seemed pretty decent at the time (don't know if later versions have changed): Message#
386863
Regards. Al
"Violence is the last refuge of the incompetent." -- Isaac Asimov
"Never let your sense of morals prevent you from doing what is right." -- Isaac Asimov
Neither a despot, nor a doormat, be
Every app wants to be a database app when it grows up