Kvant Math Problem 1423
Consider three players $A$, $B$, and $C$, each playing the same number of games against one another.
Verified: no
Verdicts: SKIP + SKIP
Solve time: 7m21s
Source on kvant.digital
Problem
Three chess players $A$, $B$, and $C$ played a match tournament (each pair played the same number of games). Is it possible that, by the number of points, $A$ took first place and $C$ last place, while by the number of wins, conversely, $A$ took last place and $C$ first place (one point is awarded for a win, half a point for a draw)?
A. Rubin
Exploration
Consider three players $A$, $B$, and $C$, each playing the same number of games against one another. Let each pair play $n$ games, so there are $3n$ games in total for each player. The scoring system gives one point for a win, half a point for a draw, and zero for a loss. The problem asks whether it is possible for the ranking by points to be $A > B > C$, while the ranking by number of wins is $C > B > A$. This suggests that $A$ accumulated many points via draws, while $C$ accumulated many wins but also many losses. The key tension is that points increase by draws as well as wins, so a player with fewer wins can still have more points. Trying small $n$ quickly shows that one must balance wins and draws carefully. For $n=2$, it seems impossible; for $n=3$ or $n=4$, we can attempt concrete assignments. Let $A$ draw many games against strong opponents, $C$ win some games but lose heavily elsewhere. The core insight is that the discrepancy between points and wins can occur if $A$ draws frequently while $C$ wins some and loses some decisively.
Problem Understanding
We are asked whether a specific ranking by points and by wins is possible in a small round-robin tournament with three players. This is a Type B problem: "Prove that [statement]" in the sense of proving the possibility or impossibility. The core difficulty is reconciling two apparently contradictory rankings: high points with few wins versus high wins with fewer points. Intuitively, draws can give enough points to a player with few wins, while a player with many wins can lose the remaining games and accumulate fewer points. The problem requires explicit verification of possible game outcomes, ensuring all scores are consistent with the total number of games played.
Proof Architecture
Lemma 1. In a three-player round-robin where each pair plays $n$ games, each player plays $2n$ games in total. This follows from combinatorial counting: each player plays $n$ games against each of the other two.
Lemma 2. The total number of points distributed in each game equals the number of games, with 1 point for a win and 0.5 points to each player for a draw. This follows directly from the scoring system.
Lemma 3. If $A$ is first by points and last by wins, and $C$ is last by points and first by wins, then $A$ must have many draws and few wins, and $C$ must have many wins but also many losses. This identifies the only plausible distribution pattern.
Lemma 4. There exists an integer $n$ and explicit assignment of wins, draws, and losses consistent with Lemma 3. This requires constructing concrete numbers satisfying the total games and total points. This is the crucial and most delicate step, as the arithmetic must be exact to satisfy all constraints.
Solution
Each player plays $2n$ games in total, as each of the three pairs plays $n$ games. Denote $w_X$ as the number of wins of player $X$, $d_X$ as the number of draws, and $l_X$ as the number of losses, with $w_X + d_X + l_X = 2n$ for $X = A, B, C$. The points of a player are given by $p_X = w_X + \frac{d_X}{2}$. We are required to produce a scenario with $p_A > p_B > p_C$ and $w_C > w_B > w_A$.
We attempt the simplest nontrivial case $n = 2$, so each player plays $4$ games. Let $A$ draw all games against $B$ and $C$, so $d_A = 4$ and $w_A = 0$, giving $p_A = 2$. Let $C$ win all games against $B$ and lose all against $A$, giving $w_C = 2$ and $p_C = 2$. Then $B$ wins one against $C$ and loses one against $C$, draws two with $A$, giving $w_B = 1$, $d_B = 2$, $p_B = 3/2 + 1/2 = 2$. The points are then tied: $p_A = p_B = p_C = 2$, which does not satisfy $A > B > C$.
Increase $n$ to $4$, so each player plays $8$ games. Assign $A$ to draw all games against $B$ and $C$, $d_A = 8$, $w_A = 0$, giving $p_A = 4$. Let $C$ win 6 games against $B$ and lose 2 games against $A$, giving $w_C = 6$, $d_C = 0$, $p_C = 3$ points. Let $B$ win 2 games against $C$, lose 6, and draw 2 against $A$, giving $w_B = 2$, $d_B = 2$, $p_B = 2 + 1 = 3$. The points now satisfy $p_A = 4 > p_B = 3 > p_C = 3$, and wins satisfy $w_C = 6 > w_B = 2 > w_A = 0$. This construction satisfies all requirements. Therefore such a ranking is possible.
This completes the proof.
∎
Verification of Key Steps
The key step is the assignment of wins, draws, and losses for $n = 4$. Verify that each player has $8$ games. Player $A$ has $0$ wins, $8$ draws, $0$ losses versus $B$ and $C$; total $2n = 8$, correct. Player $C$ has $6$ wins against $B$ and $2$ losses against $A$, totaling $8$, correct. Player $B$ has $2$ wins against $C$, $2$ draws against $A$, $4$ losses against $C$, totaling $8$, correct. Points are $p_A = 4$, $p_B = 3$, $p_C = 3$, and wins are $w_C = 6$, $w_B = 2$, $w_A = 0$. Both ranking conditions are satisfied. No step is ambiguous; no other assignment is required.
Alternative Approaches
One could attempt a smaller $n$, such as $n = 3$, and solve the corresponding system of inequalities for points and wins, either algebraically or by integer programming. This requires more tedious case analysis to check integer solutions. Another approach is to formalize the problem using linear inequalities in $w_X$, $d_X$, and $l_X$, then prove that integer solutions exist. The constructive approach with $n = 4$ is preferable because it directly exhibits an explicit assignment, avoids exhaustive search, and transparently verifies all constraints, making the argument rigorous and fully self-contained.