Three world chess champions — Fischer, Kasparov, and Karpov — play a virtual round-robin tournament, each facing the other two 7 times, for 7 total games per player. A win is worth 2 points, a draw 1 point, and a loss 0 points.
We’re told: Kasparov, the most aggressive player, won the most games. Karpov, the best defensive player, lost the fewest games. And Fischer, of course, won the tournament outright.
Is this actually possible? If so, what was the final score — and is it the only possible score consistent with the clues?
Send your solutions to DecisionManagementCommunity@gmail.com, or open a pull request to add yours here.
One submitted solution (Prolog, by Matteo Redaelli) was originally published as an external write-up whose link no longer resolves. If you’re the author (or know a working link), please open a pull request adding the
urlfield back.