Consider a position where if was player A's turn, they could make a series of moves ("the mating sequence") with forced mate.
However, it is player B's turn, and they can make a series of "delaying moves", which A needs to respond to. (Probably they are spite checks, but perhaps not necessarily). If A could proceed with the forced mate, it doesn't count as a delaying move.
At the end of the sequence of the delaying moves, A can play the exact same mating sequence to win. (The mating sequence doesn't need to be one fixed sequence of moves played regardless of B's moves, as long as the tree of moves is unaffected by the delaying moves.)
Puzzle/Question: What is the longest (finite) sequence of delaying moves?