Rectangle-free binary matrices · n = 2
Place as many ones as possible in an n × n grid. No two rows and two columns may meet at four ones.
Record comparison
number of ones · Higher is better| Record | Value / interval | Author / holder | Source |
|---|---|---|---|
| Proven optimum | Narjess Afzaly & Brendan McKay | Extremal Graphs and Turan Numbers ↗ | |
| Site record | No player record yet | — | — |
Formal definition
- GridFill each cell of an n-row, n-column grid with zero or one.
- RectangleChoose any two distinct rows and any two distinct columns. At most three of the four corners may contain ones, regardless of the entries inside.
- ConstructionSupply the entire matrix, including any all-zero rows or columns.
- ObjectiveScore one point for each one. Maximize the total.