2017/11/18 by Stoyan Kapralov, Kapralov, Stoyan, Valentin Bakoev +3
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1711.06792
openalex publication_date 2017/11/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The aim of the paper is to enumerate all closed knight paths of length n over a square board of size n+1. The closed knight paths of length 4, 6 and 8 are classified up to equivalence. We determine that there are exactly 3 equivalence classes of closed knight paths of length 4, exactly 25 equivalence classes of closed knight paths of length 6 and exactly 478 equivalence classes of closed knight paths of length 8.