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: Solution (?) by Jer)
Jer:
I agree with your calculation of the solutions including reflections and rotations.
However, I do not agree that there are very few reflections or rotations among them. Every reflection across any of the four axes (horizontal, vertical, and two diagonals) is a solution, as is every one of three rotations, and every combination of a reflection and a rotation. So most solutions have 19 reflections/rotations. At the risk of being wrong, I guess that a little over 1/20 of the 2.29*10^67 are unique. So, I guess that there are only about 0.12 * 10^67 unique solutions, and the other 2.17*10^67 are reflections or rotations or reflected rotations of those.
Edited on April 5, 2021, 7:22 pm
re(2): Solution (?)
