ILL 1985 Problem 15
Superchess is played on on a board, and it uses superknights, which move between opposite corner cells of any subboard. Is it possible for a superknight to visit every other cell of a superchessboard exactly once and return to its starting cell ?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.