Shown below is a grid of blue and yellow squares with a knight in the upper left hand corner and green square in the lower right hand corner.
Your task is to guide the knight from its starting position to the green square using regulation chess knight moves.
The knight may only visit yellow squares to reach its goal.
Please, in your answer, clearly explain the path taken.
Answer
If my Python programming is to be believed, the minimum number of moves required is 41:
No comments:
Post a Comment