Knight Coverings for Large Chessboards
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Knight coverings for square chessboards up to 26x26, and proofs of optimality for boards up to 10x10. The problem of how to cover a chessboard with the smallest number of knights has fascinated mathematicians and chess players for years. The problem is to place the smallest number of knights so that every square on the board is either occupied by a knight or attacked by a knight. All but the 23x23 are believed to be optimal.|
|Levels:||High School (9-12), College|
|Resource Types:||Games, Problems/Puzzles|
|Math Topics:||Discrete Math, Combinatorics|
© 1994-2014 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.