benchmarks.wiki / Public workspace

Omni-MATH / [i]Superchess[/i] is played on on a 12×12 board, and it uses [i]superknights[/i], which move between opposite corner cells of any 3×4 subboard. Is it possible for a [i]superknight[…

Problem

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

problem

[i]Superchess[/i] is played on on a 12×1212 \times 12 board, and it uses [i]superknights[/i], which move between opposite corner cells of any 3×43\times4 subboard. Is it possible for a [i]superknight[/i] to visit every other cell of a superchessboard exactly once and return to its starting cell ?
Plain-text mathematical notation (without MathML)
[i]Superchess[/i] is played on on a 12×12 board, and it uses [i]superknights[/i], which move between opposite corner cells of any 3×4 subboard. Is it possible for a [i]superknight[/i] to visit every other cell of a superchessboard exactly once and return to its starting cell ?
Original LaTeX notation
[i]Superchess[/i] is played on on a $12 \times 12$ board, and it uses [i]superknights[/i], which move between opposite corner cells of any $3\times4$ subboard. Is it possible for a [i]superknight[/i] to visit every other cell of a superchessboard exactly once and return to 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