The 25 Horses Puzzle: How to Find the Three Fastest in Just Seven Races

Twenty-five horses are ready to race, but the track has only five lanes. You have no stopwatch: each race tells you the order in which its horses finished, but not how their speeds compare with horses in other races. Can you identify the fastest three? Yes—in seven races. The trick is to stop racing horses as soon as the results prove they cannot reach the top three.

It sounds like a puzzle about speed. It is really a puzzle about information: which race will tell you the most, and what can you safely conclude from it?

First, Know What a Race Can—and Cannot—Tell You

Suppose five horses finish in this order: A1, A2, A3, A4, A5. You know A1 is faster than A2, and A2 is faster than A3. You also know A1 is faster than A3 without making them race again.

But if B1 wins a different heat, you cannot yet say whether B1 is faster than A1—or even A5. There are no recorded times to compare. Finishing fourth in an exceptionally fast group could still mean being faster than the winner of another group.

For the puzzle to have a definite answer, we assume each horse performs consistently: a faster horse always finishes ahead of a slower one, and there are no ties. Real races are less predictable, but those assumptions let us follow the logic with certainty.

Races 1–5: Give Every Horse a First Run

Divide the 25 horses into five groups of five, labeled A through E. Race each group once. Within a group, use the number to show finishing place:

• Group A: A1, A2, A3, A4, A5
• Group B: B1, B2, B3, B4, B5
• Group C: C1, C2, C3, C4, C5
• Group D: D1, D2, D3, D4, D5
• Group E: E1, E2, E3, E4, E5

These are rank labels, not names chosen before the races. A1 means the winner of Group A; B3 means the third-place finisher in Group B.

You can immediately rule out every fourth- and fifth-place finisher. A4, for example, finished behind A1, A2 and A3. Three horses are already known to be faster than A4, so A4 cannot be among the fastest three overall. The same reasoning removes ten horses—two from each group.

That leaves 15 possible contenders. We still do not know how the groups compare, so our next race should connect them. This kind of careful elimination is also at work in Puzzles Arcade’s 12-coin challenge: the goal is to choose a test that rules out as many possibilities as possible.

Race 6: Let the Five Winners Meet

Race A1, B1, C1, D1 and E1 against one another. The finish could come in any order, so let us rename the groups according to their winners’ results. From here on, suppose the winning group is A, followed by B, C, D and E:

A1 > B1 > C1 > D1 > E1

The > sign means “finished ahead of.” A1 is now confirmed as the fastest horse of all 25. Every horse outside Group A lost to its own group winner, and A1 beat all those winners. The direct showdown among winners gives us a way to compare horses that began in separate heats.

It is tempting to award second and third place to B1 and C1. But A2 finished behind only A1 in its own heat; it might be faster than B1. A3 and B2 might also be faster than C1. The sixth race identifies the champion, not the whole podium.

Who Is Still in Contention?

Now comes the satisfying part: use the two sets of results together to eliminate whole branches of horses.

Groups D and E are out. Even D1, the faster of those two group winners, finished behind A1, B1 and C1. Every other horse in D or E finished behind its winner, so none can reach the top three.

Only C1 survives from Group C. C2 finished behind C1. It is therefore behind at least A1, B1 and C1—three horses.

Only B1 and B2 survive from Group B. B3 finished behind B1 and B2; B1 also finished behind A1. That puts three horses ahead of B3.

Only A1, A2 and A3 survive from Group A. A4 and A5 were already ruled out in their first race.

After six races, only six horses remain possible: A1, A2, A3, B1, B2 and C1. Since A1 is already known to be the fastest, we need to compare just five candidates for the remaining two places. This is the key elimination in the seven-race solution explained by Steve Miller’s Math Riddles.

Race 7: Fill the Last Two Places

Put A2, A3, B1, B2 and C1 in the seventh race. Its first-place finisher is the second-fastest horse overall; its second-place finisher is the third-fastest. Add A1, the confirmed champion, and the puzzle is solved.

For example, suppose the seventh race finishes:

B1 > A2 > B2 > A3 > C1

Then the fastest three of all 25 are A1, B1 and A2, in that order.

A different finish can produce a different podium. If A2 beats A3 and both finish ahead of B1, the top three are A1, A2 and A3. The method works even when all three fastest horses began in the same five-horse group.

Notice what we did not need to do: race A1 again. Its place is settled. Including it in the last heat would use one of the five lanes without helping decide who comes second or third.

Why Doesn’t the Winners’ Race Finish the Job?

Seven races are sufficient, but the sixth-race result shows why the obvious shortcut fails. The first five heats tell us the order within each group. Racing their winners then tells us which group has the overall fastest horse, yet it can leave five horses competing for second and third. The seventh race resolves exactly that uncertainty. Both the worked horse-puzzle explanation at GeeksforGeeks and the Williams College math-riddle walkthrough give seven as the minimum number required.

The surprising feat is not that the horses run quickly. It is that seven carefully chosen races reveal enough about 25 horses without measuring a single speed. One result can rule out a horse that never raced against the champion, simply because we can trace a chain of horses that finished ahead of it.

That is a useful habit beyond this puzzle: ask what each clue proves, then cross off what is no longer possible. You can see the same spirit in Puzzles Arcade’s World’s Hardest Logic Puzzle, where a clever question matters more than a long string of guesses. Here, the right question just happens to have five lanes and a finish line.