A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×n chessboard in such a way that each row and each column contains exactly k‘queens’and each diagonal with length from 1 to n and slope either 1 or -1 contains at most k‘queens’. Aconstruction is given to show that this is always possible whenever n≥4 and n≥k≥1.