How many ways I can put $k$ bishops on $n\times n$ chessboard?

494 Views Asked by At

Is there a formula how to count in how many ways I can put $k$ bishops on $n\times n$ chessboard such that no two bishops threaten each other?