well that deal generator Jjust curious dont know why
#1
Posted 2011-September-05, 12:23
#2
Posted 2011-September-05, 12:30
"Can the hand generator on BBO repeat a hand before having every possible hand comes up?"
I can say (even without knowing a thing about how it is being precisely implemented) that the answer is 100% yes. Not only *can* it happen, it *will* happen with 100% certainty (well, not 100%, but it is better odds than 1:(number of particles in the universe)^(number of particles in the universe) by a lot! It's not even close.)
I hope this answered your question.
Never tell the same lie twice. - Elim Garek on the real moral of "The boy who cried wolf"
#3
Posted 2011-September-05, 12:34
BunnyGo, on 2011-September-05, 12:30, said:
"Can the hand generator on BBO repeat a hand before having every possible hand comes up?"
I can say (even without knowing a thing about how it is being precisely implemented) that the answer is 100% yes. Not only *can* it happen, it *will* happen with 100% certainty (well, not 100%, but it is better odds than 1:(number of particles in the universe)^(number of particles in the universe) by a lot! It's not even close.)
I hope this answered your question.
Tx Sir I will trust you, unless ......lol
#4
Posted 2011-September-05, 12:53
Gottis, on 2011-September-05, 12:23, said:
Are you referring to hands randomly generated?
#6
Posted 2011-September-05, 13:57
A better question would be if it's possible to generate all hands before the world ends (and I don't mean 2012)...
#7
Posted 2011-September-05, 14:18
Free, on 2011-September-05, 13:57, said:
Well, here's a list of likely ways the world will end. I'll pick a "sure thing" one in that the sun's gonna give up in about 5 billion years.
We'd need to be producing 336,123,795,000 hands a second to succeed (if we have no repeats). Good luck!
Never tell the same lie twice. - Elim Garek on the real moral of "The boy who cried wolf"
#8
Posted 2011-September-05, 15:09
BunnyGo, on 2011-September-05, 14:18, said:
We'd need to be producing 336,123,795,000 hands a second to succeed (if we have no repeats). Good luck!
It is for me totally unbelivable,..guess its true but nevertheless I dont belive it,...just 52 cards.... Think this is intresting for those who read this and not before been thinking about these shocking total sums,..when trying to promote bridge I often talk about that 28 zero number. Oh well
#9
Posted 2011-September-05, 16:47
It's actually an interesting programming problem to achieve the opposite effect, sampling without replacement -- one way to do it is with things called quasirandom numbers rather than pseudorandom numbers -- and if the number of hands were merely billions or trillions, it would be quite useful to be able to get a 'fast' Monte Carlo estimate for how common something was, that turned into an enumeration if allowed to run for awhile.
#10
Posted 2011-September-05, 21:31
#11
Posted 2011-September-05, 22:00
A more interesting question about a hand dealer is whether it can potentially deal every possible hand or not, or if there are some hands that it might never deal.
#12
Posted 2011-September-06, 01:48
TylerE, on 2011-September-05, 21:31, said:
This is not a matter of trust, it's just facts. You either choose a true RNG which doesn't contain any flaws if it's truely random, or a pseudo RNG which obviously has some (minor) flaws. But I'd rather use a PRNG that rolls double 6's maximum 9 times in a row but has great characteristics otherwise, than a PRNG that needs to roll every other combination first before it can roll double 6's again (whatever other characteristics it has).
#13
Posted 2011-September-06, 01:50
BunnyGo, on 2011-September-05, 14:18, said:
We'd need to be producing 336,123,795,000 hands a second to succeed (if we have no repeats). Good luck!
Will be easy for quantum computers. Hopefully we'll invent one within 5 billion years.
#14
Posted 2011-September-06, 09:58
Free, on 2011-September-06, 01:50, said:
Why would it be easy for quantum computers? AFAIK they can only search through lists and factor better than normal computers...this exhaust would actually be slower on one.
Never tell the same lie twice. - Elim Garek on the real moral of "The boy who cried wolf"
#15
Posted 2011-September-06, 11:39
Quote
We are trying to get some new players tomorrow at the university. I'll be sure to bring up this point
Can't claim that the game is boring if it takes that long to go through all the deals.
#16
Posted 2011-September-06, 12:07
The number of "hands" is simply 52 choose 13, which is 6.35 x1011. If we generate 1000 per second with no duplication, we can get them all in about 20 years.
The number of "deals" is immensely larger, and I am not quickly sure how to figure it up.
-gwnn
#17
Posted 2011-September-06, 12:15
billw55, on 2011-September-06, 12:07, said:
The number of "hands" is simply 52 choose 13, which is 6.35 x1011. If we generate 1000 per second with no duplication, we can get them all in about 20 years.
The number of "deals" is immensely larger, and I am not quickly sure how to figure it up.
A good point, I was discussing "deals".
Never tell the same lie twice. - Elim Garek on the real moral of "The boy who cried wolf"
#18
Posted 2011-September-06, 12:43
Not sure I understood the discussion on PRNGs. I don't think anyone's hand-writing heuristics to generate randomness.
#19
Posted 2011-September-06, 12:53
Antrax, on 2011-September-06, 12:43, said:
Not sure I understood the discussion on PRNGs. I don't think anyone's hand-writing heuristics to generate randomness.
Why not just choose 13 for N, choose 13 for S, and choose 13 for E?
52C13 * 39C13 * 26C13
"...we live off being battle-scarred veterans who manage to hate our opponents slightly more than we hate each other. -- Hamman, re: Wolff
#20
Posted 2011-September-06, 12:55
There are certain outputs that do not get generated.

Help
