On the number of open knight's tours
H\'ector Cancela, Ernesto Mordecki
TL;DR
This paper reviews the current knowledge and recent computational results regarding the number of open knight's tours on chessboards, highlighting advancements and remaining challenges in counting such tours.
Contribution
It provides a comprehensive review of the state of the art in counting open knight's tours, including recent computational findings and methodologies.
Findings
Recent computational counts of open knight tours
Summary of methods used in counting tours
Identification of open problems in the field
Abstract
We review the state of the art in the problem of counting the number open knight tours, since the publication in internet of a computation of this quantity.
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
TopicsData Management and Algorithms · Advanced Graph Theory Research · Constraint Satisfaction and Optimization