We have a solution. Oaktree is the winner!
I was careful when I asked the question, I did not ask "How can this be done", I asked "Is it possible?".
I gave a hint when Sundeep posted:
I answered:
In fact, you did not have to do any move, just think.
- When a rook passes by 2 squares in sequence they are always 1 white and 1 black.
- You remove 2 oposite corners and so you are left with 30 squares of one colour and 32 squares of the other colour.
- after the rook passes by 60 squares, it passed by 30 white an 30 black squares, there are 2 squares left but they are the same colour and so a rook could never pass by them one after the other.
Cheers
Thank you all
I was careful when I asked the question, I did not ask "How can this be done", I asked "Is it possible?".
I gave a hint when Sundeep posted:
Need to get in more thinking done i guess
I answered:
Yes, that's the right direction.
In fact, you did not have to do any move, just think.
- When a rook passes by 2 squares in sequence they are always 1 white and 1 black.
- You remove 2 oposite corners and so you are left with 30 squares of one colour and 32 squares of the other colour.
- after the rook passes by 60 squares, it passed by 30 white an 30 black squares, there are 2 squares left but they are the same colour and so a rook could never pass by them one after the other.
Cheers
Thank you all