2 ms·
52! Is greater than 2^64. Given that a PRNG has a 64-bit seed, and some period where it starts to repeat itself, any naive shuffling algorithm has some arrangem
by bediger4000 2y ago
52! Is greater than 2^64. Given that a PRNG has a 64-bit seed, and some period where it starts to repeat itself, any naive shuffling algorithm has some arrangements of cards it can't create.
Or am I thinking about this incorrectly?