“Kings Problem”的概念、定义、习题解题方法及翻译-数学辞典

单词

Kings Problem

释义

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)

(Madachy 1979), giving the sequence of doubled squares 1, 1, 4, 4, 9, 9, 16, 16, ... (Sloane's A008794). This sequence hasGenerating Function

(2)

The minimum number of kings needed to attack or occupy all squares on an Chessboard is nine, illustrated above(Madachy 1979).

See also Bishops Problem, Chess, Hard Hexagon Entropy Constant, Knights Problem, QueensProblem, Rooks Problem

References

Madachy, J. S. Madachy's Mathematical Recreations. New York: Dover, p. 39, 1979.

随便看

数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。