AlphaEvolve problems·alphaevolve:29
Block Stacking Problem
No formal proof attached. Any claim here rests on a write-up or a report.
Fidelity F0: None. No formal statement is attached to the result.
Let $n \\geq 1$. Let $C(n)$ be the largest displacement that the $n^{\\mathrm{th}}$ block in a stack of identical rigid rectangular blocks of width $1$ can be displaced horizontally over the edge of a table, with the stack remaining stable. More mathematically, $C(n)$ is the supremum of $x_n$ where $0 = x_0 \\leq x_1 \\leq \\dots\\leq x_n$ are real numbers subject to the constraints $$ \\frac{x_{i
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.
Does the formal statement say what was claimed?
F0 no formal statement None. No formal statement is attached to the result.
Computed from what the project declares and what the register holds, never from reading the mathematics. How fidelity is graded.
Follow and discuss
All discussionGet an email when this problem moves
A new claim, a check, a bounty or a discussion. One link to confirm, one click to stop.
Discussion and bounties for this problem load here.