Consider a game of chess where White delivers checkmate in their $X^{th}$ move. For all the pieces that remain on the board at the end of the game, consider their Manhattan Distances from their initial positions and take the sum. Let's say this value is $Y$.
What is the minimum possible value of $X+Y$? How many different sequences of moves can achieve this value?