Challenge: maximize the number of moves white needs for its king to reach a square of your choosing, adhering to the following rules:
- Black does not move.
- Like normal: The king may not be in a position where it's in check (after a white move, it). It is allowed at the start beingto be in check).
- The starting pieces do not exceed the normal starting material.
EDIT Extra rule: The black king cannot be attacked. Reasoning: attacking the black king with e.g. a pawn would mean black 'looses''loses' and thus the white king will not reach its destination. I realize that this is a bit doubtful since I allow a board without a black king, but it seems most reasonable to me to treat the king like this if he is on the board.
Note: the starting pieces may be placed anywhere. It does not have to be a valid chess position; even the black king may be missing.
Clarification: This means e.g. that the two bishops may cover the same color tiles, and pawns may be on the first line. On the other hand, promoted pawns are not starting pieces, and pawns on the 8th row are excluded in line with this. Pawns can be promoted during play.
Example: A lone white king on a1 will need 7 moves to reach a8; add a black rook on the h-row and it will take 14 moves.