Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths

April 02, 2023 · The Ethereal · 🏛 Mathematics and Informatics

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Stoyan Kapralov, Valentin Bakoev, Kaloyan Kapralov arXiv ID 2304.00565 Category math.CO: Combinatorics Cross-listed cs.DS Citations 0 Venue Mathematics and Informatics Last Checked 3 months ago
Abstract
Two algorithms for construction of all closed knight's paths of lengths up to 16 are presented. An approach for classification (up to equivalence) of all such paths is considered. By applying the construction algorithms and classification approach, we enumerate both unrestricted and non-intersecting knight's paths and show the obtained results.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Combinatorics

🔮 🔮 The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO 🏛 arXiv 📚 94 cites 10 years ago