Free Bertrand's Box Paradox Calculator

Bertrand's Box Paradox is a classic probability puzzle that demonstrates how easily human intuition can misjudge odds. This article walks through the problem setup, the deceptive “common‑sense” answer, the correct solution (which hinges on a $\frac{2}{3}$ probability), the connection to Bayes’ theorem, and how a dedicated probability calculator can simulate the paradox to confirm the result.

Understanding the Problem Formulation

The paradox begins with three identical boxes and a set of gold and silver coins. The boxes are arranged as follows:

• Box 1 contains two gold coins.
• Box 2 contains two silver coins.
• Box 3 contains one gold coin and one silver coin.

After shuffling the boxes, a player picks one box at random (each equally likely) and draws a single coin from that box without looking inside. The coin drawn is gold. The question is: What is the probability that the remaining coin in that same box is also gold?

Why the Intuitive Answer (1/2) Falls Short

At first glance, many people reason: “If I drew a gold coin, the box I chose must be either Box 1 (two golds) or Box 3 (one gold, one silver). Only one of those two boxes contains a second gold coin, so the chance is $1/2$.” This reasoning overlooks a crucial nuance—the fact that the coin itself is a piece of information.

When the first coin is gold, it could have originated from three equally likely possibilities:

1. The first gold coin from Box 1.
2. The second gold coin from Box 1.
3. The single gold coin from Box 3.

In scenarios 1 and 2 the remaining coin is gold; in scenario 3 it is silver. Therefore, out of the three equally probable cases that satisfy the condition “first draw is gold,” two lead to a second gold coin. The correct probability is thus $\frac{2}{3}$, not $\frac{1}{2}$.

The Correct Solution: $\frac{2}{3}$

The paradox’s resolution can be made even more transparent by enumerating the six possible coin‑draw outcomes (each coin has an equal $1/6$ chance of being drawn initially). If we discard the three outcomes that start with silver, we are left with three gold‑first outcomes, each with conditional probability $1/3$. Summing the two that come from the double‑gold box yields the final answer:

$$\text{P(second gold} \mid \text{first gold)} = \frac{2}{3}.$$

This result is independent of any assumption about coin weights or the order of draws—it is a pure consequence of the initial symmetry and the information gained from the first draw.

A Formal Approach: Bayes’ Theorem

The same result can be derived elegantly using conditional probability and Bayes’ rule. Bayes’ theorem states:

$$P(B \mid A) = \frac{P(A \mid B) \cdot P(B)}{P(A)}$$

To apply this to the paradox, define the events:

• $GG$ – the chosen box contains two gold coins.
• $G$ – the first coin drawn is gold.

We want the posterior probability $P(GG \mid G)$.

Likelihood $P(G \mid GG)$: if the box has two gold coins, the first draw is certainly gold, so $P(G \mid GG) = 1$.

Prior $P(GG)$: each box is equally likely to be chosen, so $P(GG) = \frac{1}{3}$.

Normalization factor $P(G)$: the overall probability of drawing gold from any box. This is the sum over all boxes of (probability of choosing that box) × (probability of drawing gold from that box):

$$P(G) = \frac{1}{3} \cdot 1 + \frac{1}{3} \cdot \frac{1}{2} + \frac{1}{3} \cdot 0 = \frac{1}{3} + \frac{1}{6} = \frac{1}{2}.$$

Substituting into Bayes’ formula:

$$P(GG \mid G) = \frac{P(G \mid GG) \cdot P(GG)}{P(G)} = \frac{1 \cdot \frac{1}{3}}{\frac{1}{2}} = \frac{2}{3}.$$

This formal approach confirms the intuitive enumeration without needing to list every outcome explicitly, and it highlights the role of the prior probabilities and the evidence provided by the first draw.

Simulating the Paradox with a Probability Calculator

A well‑designed probability calculator can bring this abstract reasoning to life. The calculator lets you run repeated random trials of the box–selection and coin–draw process. By tracking how often a gold first draw is followed by a second gold, the simulation converges to the theoretical $\frac{2}{3}$ probability. Users can adjust the number of trials or even modify the coin composition (while keeping the logic intact) to explore how the result changes—or, more importantly, to see that it does not change as long as the initial setup remains symmetric.

The paradox is closely related to other counter‑intuitive probability puzzles, most notably the Monty Hall problem. Both illustrate how acquiring partial information (a revealed coin or a opened door) can drastically alter the conditional probabilities, defying naive intuition.