AlphaEvolve problems·alphaevolve:65
Variant of IMO 2025, Problem 6
No formal proof attached. Any claim here rests on a write-up or a report.
Fidelity F0: Absent. No formal statement is attached to the result.
Consider a $2025 \\times 2025$ (and more generally an $n \\times n$) grid of unit squares. Matilda wishes to place on the grid some rectangular tiles, possibly of different sizes, such that each side of every tile lies on a grid line and every unit square is covered by at most one tile. Determine the minimum number of tiles $C(n)$) Matilda needs to place so that each row and each column of the grid has exactly one unit square that is not covered by any tile.
AI activity
How grades workMatched the best known construction
Reasoning and sources
Autonomy
An evolutionary coding agent searching against an evaluator written by people, who also chose the problems.
Fidelity
How fidelity is gradedF0 no formal statement. Absent. No formal statement is attached to the result.
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themSources
Cite this record
qed.bot, “Variant of IMO 2025, Problem 6”, https://qed.bot/t/alphaevolve-65, as of 30 Sep 2026.