What is the smallest number of pitches that a pitcher can pitch and still come away with a complete game (a REAL complete game; nothing rain-shortened or anything like that)?
Solution to the Problem:
The answer is 25 pitches.This could happen if the pitcher is on the away team and if every batter swung at the first pitch, with 24 out of 25 hitting into an out and the other batter hitting a home run. Assuming that the pitcher's team never scored at all, the final score would be 1 - 0 in favor of the home team, which then wouldn't have to bat in the bottom of the ninth inning.
-----------------------------------------------------------------
In March 2015, Craig Clarke (a Math teacher & amateur baseball umpire) sent the following to me:
I believe the theoretical minimum is 9 pitches:
First batter hits a triple on the first pitch of the game. Before the next pitch is thrown, the first batter, now on third, attempts to steal home. The batter interferes with the catcher trying to get out of the catcher's box. Batter is out for interference (rule 6.06(b)). This batter's interference occurs two more times in the first inning. The same scenario plays out for the next eight innings. Nine pitches total.
Obviously this would never happen, but still the theoretical minimum, I believe.
Correctly solved by:
| 1. James Alarie | Flint, Michigan |
| 2. Elisa Arostegui | Carmichael, California |
| 3. Lisa Merwin | Taylor, Michigan |