Live data from Hacker News

How can a computer deal a poker hand?

fermatslibrary.com

31–32 of 32 posts

Re: How can a computer deal a poker hand?

#31

This looks very familiar. I think I read part of it back in the 80's when I was first learning programming. I think it was in reference to "How to truly 'shuffle' a deck of cards using a computer algorithm. Lots of discussion on techniques to do close to true random shuffling of ordered decks.

It's Bentley's _Programming pearls_ column from the _Communications of the ACM_, which was collected into a series of books, such as _Programming Pearls_ and _More Programming Pearls_, where you probably saw it.

Re: How can a computer deal a poker hand?

#32
post #22
post #14

Earlier quoted context omitted.

> pulling out leading "digits" in arbitrary bases of this value Generally this bookkeeping isn't worth the complexity. Modern PRNGs are super efficient: PCG is about 3x faster than Mersenne Twister.

Well, supposing one wanted "true" randomness and had access to a source of such, but still cared to be efficient about using it.

Sure, but in practice I think we'd be hard pressed to find someone with such stringent requirements.

For all practical purposes, using your entropy stream to seed ChaCha is more than good enough. Want something with a proof? Seed a Blum Blum Shub generator.

Post reply on HN