Superchess is played on on a 12×12 board, and it uses superknights, which move between opposite corner cells of any 3×4 subboard. Is it possible for a superknight to visit every other cell of a superchessboard exactly once and return to its starting cell ? LaTeXcombinatorics unsolvedcombinatorics