A short-sighted rook is a rook that attacks all squares in the same column and in the same row for which he can not go more than 60-steps.
What is the maximal amount of short-sighted rooks that don't attack each other that can be put on a 100×100 chessboard.
(In reply to
re(2): Solution (?) by Steve Herman)
My mistake, I was reasoning backwards. I was thinking of the number of solutions that have symmetry, which is not many. These ones don't reduce the numbers of unique solutions as much.
Solutions without symmetry can be equivalent through reflection/rotation in 8 ways (the symmetries of a square.) These ones reduce the number of of solutions.
|
|
Posted by Jer
on 2021-04-06 10:34:44 |
re(3): Solution (?)
