A solution to the 7-prince's tour problem
Lorenzo Mella
TL;DR
This paper provides a solution to the open problem of finding a closed tour for the 7-prince on an 8x8 chessboard, extending previous research on similar tour problems.
Contribution
The authors solve the previously open case of the 7-prince's closed tour problem on an 8x8 chessboard.
Findings
Existence of a closed 7-prince tour on 8x8 board confirmed
New constructive solution provided
Completes the classification for k-prince tours on 8x8 boards
Abstract
In [1] the authors studied the closed tour problem on the chessboard of a chess piece, called -prince, leaving open the existence of such a tour when . In this note we find a solution to this open case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Advanced Combinatorial Mathematics