12 Knights to Attack or Occupy All Squares on Chessboard
Jump to navigation
Jump to search
Theorem
On a standard chessboard, it is a maximum of $12$ knights are needed to ensure all squares are either occipied or under attack.
Proof
Sources
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $12$