A Random Question

06132017, 06:13 AM
Post: #21




RE: A Random Question
(06112017 01:39 AM)DavidM Wrote:(06112017 12:21 AM)ttw Wrote: Third, one could use a very long cycle generator. The error from lack divisibility does decrease with cycle length. This is probably the most practical solution. The XOR+Shift and the linear congruential and the Fibonacci and other generators are all good enough in most cases if the cycle and wordlength is long enough. I posted 64bit parameters for the congruential and shift register generators somewhere on this board. (If the same length, these can be XORed together to get a longer cycle; if different lengths, either + or  is needed.) Or one could combine generators like cryptographic machines do. For games one needs good precision and very high unpredictability; for Monte Carlo, one needs high precision and cycle but can be predictable. I have a new type that I'm testing, but I have only empirical evidence that it works. When I've done a bit more testing (ok, several bits), I'll post the method. 

« Next Oldest  Next Newest »

User(s) browsing this thread: 2 Guest(s)