2023/04/02 by Stoyan Kapralov, Kapralov, Stoyan, Valentin Bakoev +3
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Combinatorics (math.CO) #D.1.0 #D.1.4 #Data Structures and Algorithms (cs.DS) #E.1 #FOS: Computer and information sciences #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2304.00565
openalex publication_date 2023/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.