Re:A ride that takes 10^20k years to complete in Roller Coas...
by dragontamer on Monday August 03, 2020 @10:42PM
(#24045998)
That's a pretty funny thought.
Even a Mersenne twister won't be enough to represent 10^20,000+ states that'd be needed to complete just one maze run.
At a minimum, you need a PRNG with 100,000+ bits... or a 12.5kB+ state machine for your PRNG before you had a decent chance of one NPC finishing the maze. I don't think any modern PRNG has such state (most states cap out at 64-bits or 128-bits these days, because there's no feasible simulation that'd use all those RNGs. Mersenne Twister was probably the last "old style" PRNG algorithm that tried to make a huge cycle-length with a large-state).
Even a Mersenne twister won't be enough to represent 10^20,000+ states that'd be needed to complete just one maze run.
At a minimum, you need a PRNG with 100,000+ bits... or a 12.5kB+ state machine for your PRNG before you had a decent chance of one NPC finishing the maze. I don't think any modern PRNG has such state (most states cap out at 64-bits or 128-bits these days, because there's no feasible simulation that'd use all those RNGs. Mersenne Twister was probably the last "old style" PRNG algorithm that tried to make a huge cycle-length with a large-state).