benchmarks.wiki / Public workspace

Omni-MATH / Let n be the maximum number of bishops that can be placed on the squares of a 6×6 chessboard such that no two bishops are attacking each other. Let k be the number of ways to put n… · Discussion

Discussing Let n be the maximum number of bishops that can be placed on the squares of a 6×6 chessboard such that no two bishops are attacking each other. Let k be the number of ways to put n… · 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.