How can a computer deal a poker hand?
fermatslibrary.com
How can a computer deal a poker hand?
1–10 of 32 posts
Re: How can a computer deal a poker hand?
#2> After solving a challenging problem, I solve it again from scratch, retracing only the insight of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that would have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value.
This has been one of my principles all my life, and I was just thinking recently about the fact that I've never seen it written down anywhere. (Also, about the fact that it really is a question of personal style, because I've read through rough work/notebooks from very successful people who don't seem to think that way at all.)
Re: How can a computer deal a poker hand?
#3> After solving a challenging problem, I solve it again from scratch, retracing only the insight of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that would have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value. This has been one of my…
Isn't that a bit like "Plan to throw the first one away"?
Re: How can a computer deal a poker hand?
#4> After solving a challenging problem, I solve it again from scratch, retracing only the insight of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that would have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value. This has been one of my…
Isn't that a bit like "Plan to throw the first one away"? https://en.wikiquote.org/wiki/Fred_Brooks
It's crazy that a sofware engineering book from the 70's is still pretty relevant
Re: How can a computer deal a poker hand?
#5Earlier quoted context omitted.
Isn't that a bit like "Plan to throw the first one away"? https://en.wikiquote.org/wiki/Fred_Brooks
It's crazy that a sofware engineering book from the 70's is still pretty relevant
True wisdom is timeless. Assuming we're still around for another two and a half millenia, I imagine the Art of War will still be read and studied.
Re: How can a computer deal a poker hand?
#6> After solving a challenging problem, I solve it again from scratch, retracing only the insight of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that would have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value. This has been one of my…
Isn't that a bit like "Plan to throw the first one away"? https://en.wikiquote.org/wiki/Fred_Brooks
Seems more like: "next time, how can I not have to throw the first one away?"
Maybe you never get to that point, but you could at least have to throw away less, or be closer to a final version the first time around.
Re: How can a computer deal a poker hand?
#7Does anyone know if this paper is part of the book Programming Pearls also by John Bentley?
Re: How can a computer deal a poker hand?
#8> It is easy to generate a random sequence of
inte- gers in the range l..N, so long as we don’t mind dupli-cates
Is it? I was surprised to learn of modulo bias [1]. Does the "Randint(1, J)" implementation take it into account? It's a very easy mistake to make and can have an impact on the uniformity of the shuffle.
If you haven't heard of it it has to do with the relationship between the range spanned by your system's RAND_MAX and J. If RAND_MAX is not a multiple of J, the highest range (RAND_MAX-J..RAND_MAX) will not deliver the entire span of J.
[1] https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#M...
Re: How can a computer deal a poker hand?
#9Does anyone know if this paper is part of the book Programming Pearls also by John Bentley?
It's in "More Programming Pearls" from the same author (who, by the way, is called Jon Bentley, not John Bentley)
Re: How can a computer deal a poker hand?
#10> It is easy to generate a random sequence of inte- gers in the range l..N, so long as we don’t mind dupli-cates Is it? I was surprised to learn of modulo bias [1]. Does the "Randint(1, J)" implementation take it into account? It's a very easy mistake to make and can have an impact on the uniformity of the shuffle. If you haven't heard of it it has to do with the relationship between the range spanned by your system'…
That article is very interesting, in a strange way. It points out so many simple, obvious things about card shuffling that aren't visible to a programmer from a high level view