Solving the Traveling Tournament Problem by Packing Three-Vertex Paths