A solution to the 7-prince's tour problem
Abstract
In [1] the authors studied the closed tour problem on the 8× 8 chessboard of a chess piece, called k-prince, leaving open the existence of such a tour when k=7. In this note we find a solution to this open case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.