Über Rösselringe auf dem Brett von \(6^ 2\) Zellen. (On knight's rings on the chessboard of \(6^ 2\) cells) (Q810513)

This paper was written by the late J. E. Hofmann and had not been submitted for publication when he died in 1973. We quote the author's introduction: ``It is well known that the \(6\times 6\) matrix is unique in the sense that there do not exist mutually orthogonal Latin squares. However, one can solve the queens problem on it. There is exactly one type of positioning 6 queens on a \(6\times 6\) board so that they do not interfere. By turning and reflecting it one gets \(4\times 6=24\) queens fields, no one of which is one of the remaining ``diagonal fields''. Additionally one can, in quite a few ways, generate 36-ary knight's moves, called knight's rings. Among them are also those, in which the tour always originates from a diagonal field to lead to another diagonal field only after two queens fields. We cover this special knight's tour problem.''