# Deceptive dice game

You must create a set of 6-sided dice and play a game with an opponent. The dice are like regular dice, but you can change the numbers on the dice. For example, regular dice have sides 123456. You could create one with sides 244678 if you want.

The game starts with the opponent selecting any one die. After this, you also must select one (also from the same set). If both of you roll the dice, the probability of you rolling a higher number should be at least 60%.

What is the largest set of such dice that can be created?

• I feel like this would be a good question of the math forum. Since it is a probability question and not a puzzle. Commented May 13, 2016 at 4:23
• This is indeed a puzzle, one that involves probability. How many pure probability questions begin with "you must create"? Admittedly, this would probably find additional interest at both mathematics.stackexchange and creationism.stackexchange . . .
– humn
Commented May 13, 2016 at 8:22
• I fail to see how this is a real puzzle. If any such set exists (and it does), then you can obviously have an arbitrarily large set of such dice. Just add dice with only 0 faces. If your opponent chooses one of these, you win! If your opponent chooses a die from the original set, you win! Commented May 13, 2016 at 8:43
• @Édouard, your comment would be a solution to this puzzle if you gave an example of such a set.
– humn
Commented May 13, 2016 at 13:09
• I suggest a modification of the puzzle as follows: After the opponent selects a die, you must select two dice (also from the same set). One of the dice you selected should beat the opponent's die at least 60% of the time, the other die should lose against you opponent's die at least 60% of the time. Commented May 13, 2016 at 17:42

You can make arbitrarily large sets of dice with this property.

• A: 4, 4, 4, 4, 0, 0
• B: 3, 3, 3, 3, 3, 3
• C: 6, 6, 2, 2, 2, 2
• D: 5, 5, 5, 1, 1, 1

A beats B, B beats C, C beats D, and D beats A with probability $\frac{2}{3}>60\%$.

Now add many copies of die B, each using a different value between 2 and 4. For example, one of these new dice could have 3.5 on every side. (If the numbers need to be integers, multiply everything by a large amount first.) A will still beat all of the B dice with the same probability, and any of the B dice will still beat C. So the strategy is:

• If the opponent chooses A, you choose D.
• If the opponent chooses any of the B's, you choose A.
• If the opponent chooses C, you choose any of the B's.
• If the opponent chooses D, you choose C.
• How many sets can you make given: numbers must be 1..6 and integer? Commented May 16, 2016 at 6:27