Knight Moves Grid
For every square of an `n × n` board, the least number of knight moves to the top-left corner.
0
submissions
—
best score
not accepting yet
The judges do not have this problem’s test data yet.
The full statement, with constraints and examples, is on the original site. The specification is at TalosEval/Problems/CSES/KnightMovesGrid/Spec.lean.
Results
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.