Definition 1. A player on the move is castlemated in case all of the following are true:
a. The player has a king which has never moved, and a rook which has never moved (nor been captured).
b. The player cannot presently castle legally.
c. The player has no legal moves except with king or that rook.
(In effect, the player is permanently prevented from castling even though he has never moved the king nor the rook.)
Definition 2. A player on the move is help-castlemated in N in case all of the following are true:
w. The player has a king which has never moved, and a rook which has never moved (nor been captured).
x. The player cannot presently castle legally.
y. There exists a sequence of N legal move-pairs during which the player never moves his king nor that rook, yet the player can never castle legally during these N moves.
z. After N moves, the player is castlemated.
(In effect, the two players are cooperating to try to prevent one of them from being castlemated, but the best they can do is N move-pairs before castlemate sets in.)
In the following example (white to move), white is help-castlemated in 2:
Contest: Find a position where white is help-castlemated in N. The winner is the person who does so for the largest N.
Prize: The winner gets to castlemate the runner-up N-M times in the public square. (M is the runner-up’s version of N.)
To avoid legalistic technicalities, please limit your entries to positions where white has only the one rook (or, if there is a second rook, it is no longer on its original square).
No “help-castlemates in infinity” allowed. That’s a separate, interesting question – does there exist a position where neither white’s king nor rook have moved, yet white can never castle, despite the best efforts of both players, even though the game can go on indefinitely with neither the king nor the rook being moved?
Bill Smythe