The math/rand package has 38848 bits of state. The seed value is only 64 bits, yes, but that's a separate question. Is seeding what you are concerned with?
-rob On Thu, Aug 16, 2018 at 1:19 PM, Pat Farrell <pat22...@gmail.com> wrote: > I want to build a poker simulator. For this, I need a nice method to > shuffle cards. A bit of googling shows that a good basic approach is the > Fisher-Yates shuffle. Its O(n) and space efficient. But it depends on the > quality of the PRNG. I am specifically concerned that the math/rand is only > 64 bits of state. Since 52! <https://en.wikipedia.org/wiki/Factorial> ≈ > 2^225.6 > we really need at least 225 bits of state within the PRNG. > > I can't be the first one to look for an algorithm to shuffle a single 52 > card deck. > > What tools and/or approaches are suitable? > > -- > You received this message because you are subscribed to the Google Groups > "golang-nuts" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to golang-nuts+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. > -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
