We have many puzzles to find complete knight's tours – including on 4D boards, irregular boards and nonplanar boards – but few puzzles to find partial tours where only some cells are visited. I present a puzzle of the latter type below. On an 8×7 board, can 26 cells be labelled 0 to 25 inclusive such that 0-1-2-…-25-0 is a closed knight's tour and every even number n is also a knight's move away from (n+7) mod 26? Can the same be done on an 8×6 board? A 7×7 board?| Recent Questions - Puzzling Stack Exchange
Simple linear algebra methods are a surprisingly powerful tool to prove combinatorial results. Some examples of combinatorial theorems with linear algebra proofs are the (weak) perfect graph theor...| MathOverflow