I put hi first in a lot of range-based what-have-you's b/c more often than not, lo is 0

your test code, i gather from brief glances at various threads, is a good short-term indicator of randomness.

these silly RNGs keep distracting me from my new ray tracer :-)

i'm testing the mod method on a ubyte LCG. just need "a few hours" debugging my test. i kind of already know the result but .. gotta code it ... Boom. function LCG as ubyte: const mul = 23, add = 3 static as ushort state: state = mul * state + add return state shr 8 End Function function r...

also, you could get rid of the hi (+ 1) if you change params to double

deltarho[1859] wrote:Perhaps we need to write our own Mod function if it is fast enough.

:-)

i'm having a blast with this RNG stuff

theory vs. practice. are they frozen or are they moving? (dont say yes :P)

range using modulus may fit unevenly into 2^64. the remainder goes to the least significant digits

imo you should just show them something.

acorns

always looking for ways to speed up my non-critical applications :-)

' Complex Sequence Generator 3 by dafhi - 2018 Nov 13 ' high period, high configurability PRNG ' breezes PractRand to 32TB type CSG3_LITERAL as ubyte 'ulongint dim shared as CSG3_LITERAL csg3_mul = 255 ' non-ideal (32TB: 1645) dim shared as CSG3_LITERAL csg3_add = 1 ' 2^bits co-prime? (&H5851F4...

Int() is notoriously slow. even gcc -O 3 doesn't optimize it out

use this instead

those clouds.

[update] totally forgot. happy birthday :-)

' ------------------------------------------------------------------- ' RPG level stats by dafhi ' ' release date: 2018 Oct 26 ' ' Based upon my journey through World of Warcraft ' coded sometime around 2015 ' ------------------------------------------------------------------- type stat_literal as ...

one cannot deny the benefit of knowing asm. thanks for sharing

working on my newest random number generator, i thought i'd try a multiplier of 4, which produces a cool reflection pattern function CSG_ii as double '' 2018 Sep 17 '' produces a cool pattern const as ulongint mul = 4 static as ulongint a, state = 0 a += 1 - (state = 0) state = state shl 57 or state...

@deltarho - the point is that luck isn't a factor.

anyway, again, thanks for this cool framework

However, your LCV managed to get to 1MB and failed have a look at a plain jane LCG's low bits function CSG as ulong const mul = 6364136223846793005ull '' Knuth's const add = 1442695040888963407ull static as ulongint state = 1 state = mul * state shr 0 + add return (state and 4294967295) End functio...