Balance puzzle

Logic puzzle

Nº Q3823917 ★

Common · Knowledge

Balance puzzle

Logic puzzle

A balance puzzle or weighing puzzle is a logic puzzle about balancing items—often coins—to determine which one has different weight than the rest, by using balance scales a limited number of times. The solution to the most common puzzle variants is summarized in the following table: For example, in detecting a dissimilar coin in three weighings (⁠ n = 3 {\displaystyle n=3} ⁠), the maximum number of coins that can be analyzed is ⁠ 1 2 ( 3 3 − 1 ) = 13 {\displaystyle {\tfrac {1}{2}}(3^{3}-1)=13} ⁠.

Last price

—

Floor price

—

7-day median

—

30-day sales

0

30-day range

—

In circulation

0

Price history

Show table
Datemedian LowHighsales

Sales history

Last sale
—
30-day average
—
30-day low
—
30-day high
—
Sales 7d
0
Sales 30d
0

No sales yet.

Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.

From Wikipedia

A balance puzzle or weighing puzzle is a logic puzzle about balancing items—often coins—to determine which one has different weight than the rest, by using balance scales a limited number of times. The solution to the most common puzzle variants is summarized in the following table: For example, in detecting a dissimilar coin in three weighings (⁠ n = 3 {\displaystyle n=3} ⁠), the maximum number of coins that can be analyzed is ⁠ 1 2 ( 3 3 − 1 ) = 13 {\displaystyle {\tfrac {1}{2}}(3^{3}-1)=13} ⁠. Note that with ⁠ 3 {\displaystyle 3} ⁠ weighings and ⁠ 13 {\displaystyle 13} ⁠ coins, it is not always possible to determine the nature of the last coin (whether it is heavier or lighter than the rest), but only that the other coins are all the same, implying that the last coin is the dissimilar coin. In general, with ⁠ n {\displaystyle n} ⁠ weighings, one can always determine the identity and nature of a single dissimilar coin if there are ⁠ 1 2 ( 3 n − 3 ) {\displaystyle {\tfrac {1}{2}}(3^{n}-3)} ⁠ or fewer coins. In the case of three weighings, it is possible to find and describe a single dissimilar coin among a collection of ⁠ 12 {\displaystyle 12} ⁠ coins. This twelve-coin version of the problem appeared in print as early as 1945 and Guy and Nowakowski explain it "was popular on both sides of the Atlantic during WW2; it was even suggested that it be dropped over Germany in an attempt to sabotage their war effort".

Text: Wikipédia, CC BY-SA 4.0. · Image: Cmglee (CC BY-SA 4.0) ·

Related cards

Confirmation