Dice That Beat Each Other in a Circle
The puzzle
Four dice carry these faces: 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. Two players each pick a die, roll, and the higher number wins.
Show that A beats B, B beats C, C beats D and D beats A, each with probability 2/3. How should you play if your opponent chooses first?
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Work out each matchup by listing which faces of one die beat which of the other.
Hint 2
There is no "best" die. Whichever your opponent takes, one of the others beats it.
Show the answer Hide the answer
Every one of the four matchups goes 24-12 in 36 - exactly 2/3. Let your opponent choose, then take the die that beats theirs, and you win two games in three.
How to get there
A against B: A wins whenever it shows 4, which is 4 faces out of 6, so 2/3. B against C: B's 3 beats C's 2, and C shows 2 on 4 faces out of 6, so again 2/3.
C against D: C wins outright with a 6 (2 faces), and with a 2 it still wins if D shows 1 (3 faces of 6). That is 2/6 + (4/6)(3/6) = 12/36 + 12/36 = 24/36 = 2/3. D against A: D's 5 beats everything A has, and D's 1 beats A's 0, giving (3/6)(6/6) + (3/6)(2/6) = 18/36 + 6/36 = 24/36 = 2/3.
So "beats" runs in a loop, like rock-paper-scissors. There is no contradiction: beating-on-average is a comparison between distributions, and distributions are not points on a line. The practical consequence is that the second chooser has a two-to-one advantage, which is the opposite of what intuition about "picking the best" suggests.
The technique worth keeping
Do not assume an ordering exists just because pairwise comparisons do. Check transitivity explicitly - in voting, in sports rankings and in dice, cycles are common, and whoever moves second exploits them.