Kings Problem
The problem of determining how many nonattacking kings can be placed on an 
Chessboard. For 
, thesolution is 16, as illustrated above (Madachy 1979). In general, the solutions are
 | (1) |
 | (2) |
The minimum number of kings needed to attack or occupy all squares on an 
Chessboard is nine, illustrated above(Madachy 1979).
References
Madachy, J. S. Madachy's Mathematical Recreations. New York: Dover, p. 39, 1979.
- Mira Fractal
- Mirimanoff's Congruence
- Mirror Image
- Mirror Plane
- Misère Form
- Mitchell Index
- Miter Surface
- Mittag-Leffler Function
- Mittenpunkt
- Mixed Partial Derivative
- Mixed Strategy
- Mixed Tensor
- Mnemonic
- Mock Theta Function
- Mod
- Mode
- Model Completion
- Mode Locking
- Model Theory
- Modified Bessel Differential Equation
- Modified Bessel Function of the First Kind
- Modified Bessel Function of the Second Kind
- Modified Spherical Bessel Differential Equation
- Modified Spherical Bessel Function
- Modified Struve Function