KNIGHT    DOMINATION

The Knight Covering Problem is to dominate a chessboard by occupying or attacking every square using the minimum number of knights. Optimal Solutions Optimality Proofs Rectangular Boards Large Boards Infinite Board This site contains optimal solutions and proofs for the Knight Covering Problem on various board sizes.

Magic and Multimagic Squares    Theorems, Proofs, Formulations, and Solutions