benchmarks.wiki / Public workspace

Omni-MATH / A lame king is a chess piece that can move from a cell to any cell that shares…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

A lame king is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a 7×77 \times 7 grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).
Plain-text mathematical notation (without MathML)
A lame king is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a 7×7 grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).
Original LaTeX notation
A lame king is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a $7 \times 7$ grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import