摘要: In this paper, we consider counting the number of ways to place kings on an k× n chessboard, such that every square is dominated by a king. Let f (k, n) be the number of dominating configurations. We consider the asymptotic behavior of the function f (k, n).
researchgate.net 参考文章(0)