1 citations · 1 across the 6 of their papers we have counts for
1 paper · 1 filter
Stoyan Kapralov, Valentin Bakoev, Kaloyan Kapralov
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.…