TOPICS

# Kings Problem

The problem of determining how many nonattacking kings can be placed on an chessboard. For , the solution is 16, as illustrated above (Madachy 1979). In general, the solutions are

 (1)

(Madachy 1979), giving the sequence of doubled squares 1, 1, 4, 4, 9, 9, 16, 16, ... (OEIS A008794). This sequence has generating function

 (2)

The minimal number of kings needed to occupy or attack every square on an chessboard (i.e., domination numbers for the king graphs) are given for , 2, ... by 1, 1, 1, 4, 4, 4, 9, 9, 9, 16, ... (OEIS A075561), with the case illustrated above and noted by (Madachy 1979, p. 39). In general, for an chessboard,

 (3)

## See also

Bishops Problem, Chess, Hard Hexagon Entropy Constant, Knights Problem, Queens Problem, Rooks Problem

## Explore with Wolfram|Alpha

More things to try:

## References

Madachy, J. S. Madachy's Mathematical Recreations. New York: Dover, p. 39, 1979.Sloane, N. J. A. Sequences A008794 and A075561 in "The On-Line Encyclopedia of Integer Sequences."Watkins, J. Across the Board: The Mathematics of Chessboard Problems. Princeton, NJ: Princeton University Press, 2004.

Kings Problem

## Cite this as:

Weisstein, Eric W. "Kings Problem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/KingsProblem.html