Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Knight Coverings for Large Chessboards

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.contestcen.com/knight.htm
Author:Frank Rubin
Description: 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
Languages: English
Resource Types: Games, Problems/Puzzles
Math Topics: Discrete Math, Combinatorics

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.