benchmarks.wiki / Public workspace

Omni-MATH / Divide an m-by-n rectangle into mn nonoverlapping 1-by-1 squares. A polyomino of this rectangle is a subset of these unit squares such that for any two unit squares S,T in the poly… · Discussion

Discussing Divide an m-by-n rectangle into mn nonoverlapping 1-by-1 squares. A polyomino of this rectangle is a subset of these unit squares such that for any two unit squares S,T in the poly… · 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.