The king is on a chessboard filled with poison ivy bushes. Can the king get to safety?
The king is initially located at the top left-hand corner square of the chessboard.
The finite chessboard is of size $n \times n$ where $n \ge 4$.
There are $n$ poison ivy bushes each on a different square of the chessboard.
Two poison ivy bushes are never in the same horizontal row, vertical column or any diagonal.
The above restriction on the poison ivy bushes is the same as the restriction on the queens in the Eight Queens Puzzle.
If the king moves to a square that contains a poison ivy bush, the king suffers greatly.
The king’s initial square and the safety square (which is located at the lower right-hand corner square of the chessboard) do not contain poison ivy bushes.
At any point in time, the king can only move either one square down or one square to the right. The king can not move diagonally.
The king has limited vision and can see if there are poison ivy bushes in the two squares that he can move to but not other squares.
The king knows all the above information (including the value of $n$) but does not know where the poison ivy bushes are located.
Is there a strategy that would allow the king to succeed in moving to the safety square without ever moving to a square that contains a poison ivy bush? For the strategy to be valid, it must allow the king to avoid all the poison ivy bushes no matter where they are located and no matter how large the chessboard is.