In 1976, Alspach, Mason, and Pullman conjectured that any tournament 𝑇 of even order can be decomposed into exactly ex(𝑇) paths, where ex(𝑇) ∶= 1 2 ∑ 𝑣∈𝑉(𝑇) |𝑑 + 𝑇 (𝑣) − 𝑑 − 𝑇 (𝑣)|. We prove this conjecture for all sufficiently large tournaments. We also prove an asymptotically optimal result for tournaments of odd order.