The complexity and state space of the Poker is not large. Therefore it is possible to just exhaustively search all the combinations. In fact you can even calculate the probability of getting each cards with some arithmetic. I would recommend you to read Poker Theory and Analytics by Kevin Desmond on MIT Open Courseware to … Read more
There is a lot of things wrong with this code. Your problem is, because you are randoming more and more instead of using te ran variable you declared at the beggining of deal method. After you declared your ran variable, don’t do dealer.nextInt(deck.length), replace it with ran. Your shuffling is not really shuffling, check this: … Read more
The described behavior reminds me of a root function. it doesn’t affect numbers that are small but the larger numbers we insert into the function, the more it gets squashed down. You can vary the “factor of squashing” by multiplying x with a coefficient Alternatively, you can use a logarithmic function which is the reverse … Read more