Originally, every square of a \( 8\times8\) chessboard contains a rook. A rook attacks another rook if they are on the same row or column and there are no other rooks between them. You may remove a rook (one at a time) if it currently attacks an odd number of rooks.
Find the maximal number of rooks that can be removed.
Excel in math and science
Master concepts by solving fun, challenging problems.
It’s hard to learn from lectures and videos
Learn more effectively through short, conceptual quizzes.
Our wiki is made for math and science
Master advanced concepts through explanations,
examples, and problems from the community.
Used and loved by 4 million people
Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.
Your answer seems reasonable.
Find out if you're right!