Sue and Kelly are playing a game with 5 sticks of lengths 1, 2, 3, 4, and 5. In this game, Sue randomly picks 2 of the sticks and Kelly deliberately picks 1 stick. In addition, Kelly can choose when she makes her pick (picking first, picking between Sue's picks, or picking last). Kelly's goal is to form a non-degenerate triangle from the 3 sticks chosen.
Which sequence of picks will give Kelly the greatest chance of making a triangle?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Couldn't we somewhat intuitively see that if Kelly goes last she will definitely play optimally while in other cases there is a chance she makes mistake
As I explained in cases A and B, it just cannot be a mistake for Kelly to choose 4. Again, 4 is the magic number. (Choose something else like 3 and see if there is any possibility that you can beat 4.)
Relevant wiki: Triangle Inequality
The three ways to make a non-degenerate triangle are 234, 245 and 345, all others fail.
Every combination of two sticks that does not contain the 1 can thus be made into a triangle (23, 24, 25, 34, 35, 45).
This means it does not matter which sticks you get as long as it's not stick number 1.
When you choose a stick before the end, the chances of drawing the 1 randomly increases (because there are less options to choose from). For that reason alone, picking last offers the best chance.
"It does not matter as long as it's not stick 1" is not true - we also want to avoid 2,3,5
Log in to reply
But if we had any two of the two three five combination we could pick 4 as our last move
If Sue's 2 picks include a 1, Kelly can't make a triangle. If Sue's 2 picks don't include a 1, Kelly can always make a triangle. The sequence of picks giving Sue the greatest chance of not picking a one gives Kelly the greatest chance of making a triangle. If Kelly picks before either of Sue's picks, Kelly will not pick 1, and this will increase the chance of Sue picking 1 (as there are fewer sticks remaining). Therefore Kelly should pick after both of Sue's picks.
235 is degenerate, but this is also avoided when Kelly picks last
Relevant wiki: Geometric Probability - Problem Solving
The only valid combinations are a < b < c where a > c − b and c < a + b . This leaves the choices { 2 , 3 , 4 } , { 2 , 4 , 5 } , { 3 , 4 , 5 } .
Analysis of KSS :
Each of Kelly's choices leaves four sticks for Sue; there are six equally likely pairs she can pick.
Kelly 1 2 3 4 5 Sue’s winning picks (none) 3 4 , 4 5 2 4 , 4 5 2 3 , 2 5 , 3 5 2 4 , 3 4 probability 0 1 / 3 1 / 3 1 / 2 1 / 3 Thus if Kelly picks first, her best odds are with stick #4, giving probability of winning 1 / 2 .
Analysis of SKS :
Consider the possibilities of the first draw, and the following choices for Kelly. We can immediately rule out K = 1 . After Kelly's choice, Sue will have three remaining sticks to pick from, each with probability 1 / 3 .
Sue 1 2 3 4 5 Kelly any 3 4 5 2 4 5 2 3 5 2 3 4 Sue’s winning picks none 4 3 , 5 4 4 2 , 5 4 3 , 5 5 2 , 3 4 4 2 , 3 probability 0 1 / 3 2 / 3 1 / 3 1 / 3 2 / 3 1 / 3 2 / 3 1 / 3 2 / 3 1 / 3 1 / 3 2 / 3
Thus, for S = 1 there is no chance of winning; for S ≥ 2 , Kelly can always choose a stick to make the remaining chance of winning 2 / 3 . The combined probability is 5 1 × 0 + 5 4 × 3 2 = 1 5 8 .
Analysis of SSK :
There are 10 possible combinations for Sue to draw initially. Four of these contain length 1, with no chance of winning. For the remaining six (23, 24, 25, 34, 35, 45), Kelly can always choose a stick to complete the triangle. Thus the combined probability is 6 / 1 0 = 3 / 5 .
Conclusion: the probabilities compare as 5 3 > 1 5 8 > 2 1 ∴ S S K > S K S > K S S .
How different would the results be if Sue picked the sticks adversarially?
Log in to reply
The chance of making a triangle would be zero. Sue could always pick the stick of length 1 to mess up everything.
234, 245, and 345 are the only options, which can be found by quickly using the triangle inequality. The important observation is that 1 is in no triangle. In fact, after listing all possibilities, only one degenerate triangle out of seven does not contain a 1: 235. It is clear that minimizing the chance of a 1 getting chosen will maximize the probability of a triangle. Intuitively, having Sue pick last is the worst option since there are less "safe" sticks to choose from. But I'll quickly do the math anyway:
The probability Sue picks a 1 will always be the probability she picks 1 on her first turn + the probability she doesn't pick 1 on her first turn but picks 1 on her second turn.
If Kelly chooses first, then Sue has a 4 1 + 4 3 ∗ 3 1 = 2 1 probability of picking 1.
If Kelly chooses second, then Sue has a 5 1 + 5 4 ∗ 3 1 = 1 5 7 probability of picking 1.
If Kelly chooses last, then Sue has a 5 1 + 5 4 ∗ 4 1 = 5 2 probability of picking 1.
Therefore, Kelly will have a greater chance of creating a triangle if she picks last.
Claim: The probability of Kelly making a triangle is the same as the probability of Sue NOT selecting the stick of length 1. (See below for the reasoning.) If this claim is true, the best thing Kelly can do is to delay her choice and leave as many non-1 sticks in the pile as possible during Sue's selections. So later is better. P ( K S S ) = 1 × 4 3 × 3 2 = 2 1 = 3 0 1 5 P ( S K S ) = 5 4 × 1 × 3 2 = 1 5 8 = 3 0 1 6 P ( S S K ) = 5 4 × 4 3 × 1 = 5 3 = 3 0 1 8 Reasoning behind the claim:
If Sue randomly selects 1, Kelly will never be able to form a triangle, no matter when she selects.
If Sue randomly avoids 1, Kelly will always be able to form a triangle, no matter when she selects. Kelly just has to avoid the number 1 and the combination 2-3-5.
Both of these are always doable for Kelly, no matter when she selects.
4 must be one of the sticks chosen. Since Sue is choosing randomly, the probability of the pick sequence creating a non-degenerate triangle is maximized when Sue chooses a 4. Thus, Sue should make both picks before Kelly.
Problem Loading...
Note Loading...
Set Loading...
There are the following 10 ways to choose 3 out of 5 sticks of lengths 1, 2, 3, 4, 5:
1 2 3 , 1 2 4 , 1 2 5 , 1 3 4 , 1 3 5 , 1 4 5 , 2 3 4 , 2 3 5 , 2 4 5 , 3 4 5 .
Three facts to note about this list are as follows:
Now, let's calculate the probability that Sue and Kelly together can get a non-degenerate triangle, for each of the 3 sequences given:
A. Kelly-Sue-Sue (Kelly going first)
As explained, 4 always works as long as 1 is not one of the other two numbers. However, even without 1, the number 2, 3, or 5 doesn't always work because of the possibility of getting 235. So, 4 is the best choice for Kelly, and we need to calculate the probability that, given Kelly's pick of 4, Sue randomly picks two numbers, not including 1, out of 1, 2, 3, 5: 1 − ( 2 4 ) ( 1 1 ) × ( 1 3 ) = 1 − 6 3 = 0 . 5 . ( or equivalently ( 2 4 ) ( 2 3 ) = 0 . 5 )
B. Sue-Kelly-Sue (Kelly going second)
Kelly doesn't even need to make her pick because there is no chance to get a triangle with 1 included. So, the probability here is 5 1 × 0 = 0 .
Kelly definitely chooses 4 and hopes that Sue will not pick "1" out of the remaining three numbers which include "1" and two numbers other than Sue's pick (2, 3, or 5) and Kelly's pick (4). The total probability of this happening (for all three of 2, 3, and 5) is 3 × 5 1 × 3 2 = 5 2 .
Kelly chooses one of 2, 3, 5 (anything but 1) and hopes for exactly the same as in 2 just above, the probability of which is 5 1 × 3 2 = 1 5 2 .
Therefore, all together, the probability of getting a triangle for the sequence Sue-Kelly-Sue is 0 + 5 2 + 1 5 2 = 1 5 8 ≈ 0 . 5 3 .
C. Sue-Sue-Kelly (Kelly going last)
As explained in fact #3 above, if Sue happens not to include "1" in her two random choices, all Kelly needs to do is to either choose 4 if it's not there, or choose anything but 1 if 4 is already there. Therefore, the probability to be calculated in this case is just the probability that Sue's two picks don't include 1 : 1 − ( 2 5 ) ( 1 1 ) × ( 1 4 ) = 1 − 1 0 4 = 0 . 6 . ( or equivalently ( 2 5 ) ( 2 4 ) = 0 . 6 )
From A, B, C, we can conclude that the sequence Sue-Sue-Kelly has the greatest probability of 0.6.