What are the number of ways two knights can be placed on a k×k chessboard so that they do not attack each other?
For k from 1 to 8, the answer is given below. How do I find a general formula? 0 6 28 96 252 550 1056 1848
Here's my approach after @Peter 's help, I came to a conclusion that number of ways such that they attack is equal to two times the number of possible ways I can put an "L" shape on the board. (2 times because knights can swap positions), am I right? I don't know how do I more forward from here.
I tried finding number of ways to place L by this recursive formula: F[n][n]=4+F[i][i-3]+F[i-2]; But it's not working.