  We study k-dependence and half domination problems for king's graphs in
dimension n (n>1). Various sharp bounds are provided and a few conjectures are
formulated in the cases the estimates are not the best possible.
