The puzzle is solved by assigning values to A, B, and C and creating two corner-to-corner trips using knight’s moves so that each trip scores 2024. The method to calculate the score is: (a) moving between two different integers multiplies the score by the value the knight is moving to, and (b) moving between two identical integers increments the score with the value the knight is moving to. When a score equals 2024, the solver verifies whether an opposing trip exists with the same values and score.