benchmarks.wiki / Public workspace

Omni-MATH / Originally, every square of 8×8 chessboard contains a rook. One by one, rooks which attack an odd number of others are removed. Find the maximal number of rooks that can be removed… · Discussion

Discussing Originally, every square of 8×8 chessboard contains a rook. One by one, rooks which attack an odd number of others are removed. Find the maximal number of rooks that can be removed… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.