Two dice A and B each have six faces, so rolling them together produces 36 equally likely ordered outcomes. Lay those outcomes out as a grid, with A's faces down the rows and B's faces across the columns, and the whole comparison sits in front of you at once. Each cell holds the result of one matchup: a win for A when A's face is strictly larger, a loss when it is smaller, and a tie when the two faces are equal. Counting the winning cells is the entire computation.
Non-Transitive Dice: The Endless Dominance Spiral
Computing P(A Beats B) from the Faces
Every Face Against Every Face
1 / 5
If no die can be called the strongest, then every arrow in that cycle has to be earned face by face. So take two dice, A and B, and roll them together.
0:00 / 0:00