Ask The Wizard #257
For our visually impaired gamblers, could you create a user-friendly blackjack strategy guide? The conventional charts are often not compatible with screen readers. A detailed step-by-step instruction would be incredibly helpful and appreciated!
It's safe to say that I have a good rapport with theblindvisually impaired. Here is my Wizard’s Simple Strategy This is presented in simplified text format. Although this is a different approach from the more efficient basic strategy, which is lengthy to convey.
Always:
- Hit hard 8 or less.
- Stand on hard 17 or more.
- Hit on soft 15 or less.
- Stand on soft 19 or more.
- With a total of 10 or 11, double your bet if your total exceeds the dealer's visible card value (considering an ace as 11 points), otherwise, draw another card.
- Surrender 16 against 10.
- Split eights and aces.
If your hand doesn't adhere to any of the established 'always' guidelines, and the dealer shows a card from 2 to 6, follow this play strategy:
- Double on 9.
- Stand on hard 12 to 16.
- Double soft 16 to 18.
- Split 2’s, 3’s, 6’s, 7’s, and 9’s.
If the player's hand doesn't match the previous 'always' rules and the dealer reveals a card from 7 to Ace, you should hit.
For a complete breakdown of the basic strategy in textual format, kindly refer to my 4-deck to 8-deck basic strategy .
Two standard decks of 54 cards, including two jokers, are mixed together. A player receives half of this deck. What are the odds that this player has all four red threes?
There are 4 red threes among a total of 104 additional cards. The only way for the player to secure all four red threes is singular. The total combinations for the player to obtain 50 cards from the other 104 is given by combin (104,50)= 1.46691 × 1028If you're uncomfortable calculating with such large digits, there's an alternative approach. Label the four red threes as 1 through 4. The chance that the first red three is in the player's hand is 54/108. After removing the first three, the probability that the player has the second red three is 53/107 since the player now possesses 53 cards out of 107 remaining. Following this logic, the chance for the third red three is 52/106, and for the fourth, it's 51/105. Multiplying those probabilities together results in approximately 0.059012.30. combin(104,50)/combin(108,54) = 0.059012.
This topic was presented and debated on the forum of my affiliated site
Which video poker variant showcases the highest level of variance? Wizard of Vegas .
I would speculate that Royal Aces Bonus Poker holds that distinction. I encountered it once in Mesquite many years back. It rewards 800 for obtaining four aces but starts at the minimum with a pair of aces, differing from the usual pair of jacks. Below is the pay table.
The standard deviation is a staggering 13.58! This figure exceeds that of 9-6 Jacks or Better, which has a standard deviation of only 4.42.
Royal Aces Bonus Poker
Hand | Pays | Combinations | Probability | Return |
---|---|---|---|---|
Royal flush | 800 | 490,090,668 | 0.000025 | 0.019669 |
Straight flush | 100 | 2,417,714,292 | 0.000121 | 0.012129 |
Four aces | 800 | 4,936,967,256 | 0.000248 | 0.198140 |
Four 2-4 | 80 | 10,579,511,880 | 0.000531 | 0.042460 |
Four 5-K | 50 | 31,662,193,440 | 0.001588 | 0.079421 |
Full house | 10 | 213,464,864,880 | 0.010709 | 0.107090 |
Flush | 5 | 280,594,323,000 | 0.014077 | 0.070384 |
Straight | 4 | 276,071,121,072 | 0.013850 | 0.055399 |
Three of a kind | 3 | 1,470,711,394,284 | 0.073782 | 0.221346 |
Two pair | 1 | 2,398,705,865,028 | 0.120337 | 0.120337 |
Pair of aces | 1 | 1,307,753,371,584 | 0.065607 | 0.065607 |
Nothing | 0 | 13,935,843,099,816 | 0.699126 | 0.000000 |
Total | 19,933,230,517,200 | 1.000000 | 0.991982 |
However, when limiting to commonly found games, I would suggest the Triple Double Bonus, which has a standard deviation of 9.91. Here is the corresponding pay table.
Five sailors manage to survive a shipwreck. Their first action is to collect coconuts and consolidate them into a large communal pile. Although they intend to distribute the coconuts evenly later, the exhausting effort leaves them too fatigued to do so. They decide to rest for the night, planning to sort the pile in the morning.
Triple Double Bonus Poker
Hand | Pays | Combinations | Probability | Return |
---|---|---|---|---|
Royal flush | 800 | 439,463,508 | 0.000022 | 0.017637 |
Straight flush | 50 | 2,348,724,720 | 0.000118 | 0.005891 |
4 aces + 2-4 | 800 | 1,402,364,496 | 0.000070 | 0.056282 |
4 2-4 + A-4 | 400 | 3,440,009,028 | 0.000173 | 0.069031 |
4 aces + 5-K | 160 | 2,952,442,272 | 0.000148 | 0.023699 |
4 2-4 + 5-K | 80 | 6,376,626,780 | 0.000320 | 0.025592 |
4 5-K | 50 | 31,673,324,076 | 0.001589 | 0.079449 |
Full house | 9 | 206,321,656,284 | 0.010351 | 0.093156 |
Flush | 7 | 311,320,443,672 | 0.015618 | 0.109327 |
Straight | 4 | 252,218,322,636 | 0.012653 | 0.050613 |
3 of a kind | 2 | 1,468,173,074,448 | 0.073655 | 0.147309 |
Two pair | 1 | 2,390,581,734,264 | 0.119929 | 0.119929 |
Jacks or better | 1 | 3,944,045,609,748 | 0.197863 | 0.197863 |
Nothing | 0 | 11,311,936,721,268 | 0.567491 | 0.000000 |
Total | 19,933,230,517,200 | 1.000000 | 0.995778 |
Which video poker variant showcases the highest level of variance? Wizard of Vegas .
Regrettably, the sailors lack trust in one another. As midnight strikes, one sailor awakens and decides to take his fair portion. He divides the pile into five equal sectors but finds one coconut remains. He hides his share, combines the other four portions back into the community pile, and gives the leftover coconut to a monkey.
At 1:00 AM, 2:00 AM, 3:00 AM, and 4:00 AM, each of the remaining four sailors repeats the same action.
When morning arrives, no one admits to their previous actions, and they proceed as initially planned, aiming to share the pile equally again. Once more, one coconut is left over, and they hand it to the monkey.
What is the minimum count of coconuts that could have existed in the initial pile?
The initial pile contained exactly 15,621 coconuts. For my solution, continue scrolling down for another 100 lines.
"Scroll down 100 lines for the answer.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
Let c represent the original count of coconuts and f signify the amount each sailor receives after the final division.
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
Following sailor 1's selection and giving a coconut to the monkey, the remaining total will be (4/5) × (c - 1) = (4c - 1)/5.
After sailor 2 takes his share and offers a coconut to the monkey, the remaining pile will equal (4/5) × (((4c - 1)/5) - 1) = (16c - 36)/25.
Once sailor 3 takes his share and donates a coconut to the monkey, the remaining quantity will be (4/5) × (((16c - 36)/25) - 1) = (64c - 244)/125.
After sailor 4 takes his share and provides a coconut to the monkey, what remains will be (4/5) × (((64c - 244)/125) - 1) = (256c - 1476)/625.
Once sailor 5 takes his share and gives a coconut to the monkey, the remaining pile will be (4/5) × (((256c - 1476)/625) - 1) = (1024c - 8404)/3125.
By the morning, each sailor will receive f = (1/5) × (((1024c - 8404)/3125) - 1) = (1024c - 11529)/15625.
Thus, the challenge is to identify the smallest value of c such that f = (1024c - 11529)/15625 remains an integer. We can express c in terms of f.
Therefore, what is the least f for which 265 × (f + 1) / 1024 yields an integer? Since 265 and 1024 share no common factors, f + 1 must be divisible by 1024. The smallest value for f + 1 that satisfies this is 1024, indicating f = 1023.
(1024×c-11529)/15625 = f
1024c - 11529 = 15625×f
1024c = 15625f+11529
c = (15625f+11529)/1024
c = 11+((15625×f+265)/1024)
c = 11+15×f+(265×(f+1))/1024
Here's the distribution of coconuts among each sailor and the monkey.
Thus, c = (15625×1023+11529)/1024 = 15,621.
David Filmer, who challenged me with this question, already had the answer. He requested the formula for the general scenario with s sailors, but I struggled sufficiently with this specific case of five sailors. David informs me the solution for the general case is c = s.
Coconut Problem
Sailor | Coconuts |
1 | 4147 |
2 | 3522 |
3 | 3022 |
4 | 2622 |
5 | 2302 |
Monkey | 6 |
Total | 15621 |
Below are some links that offer alternative resolutions to the problem:s+1- s + 1.
I’ll leave that proof to the reader.
mathworld.wolfram.com/MonkeyandCoconutProblem.html