Nknights Combinations - 2d As 1d - Knight Chooses
1. You are given a number n, representing the size of a n * n chess board. 2. You are required to calculate and print the combinations in which n knights can be placed on the n * n chess-board. 3. No knight shall be able to kill another. Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't force you but the intention is to teach a concept. Play in spirit of the question.
1 <= n <= 5
A number n
Check the sample output and question video
k k - - k - k - k - - k - k k - - k - k - - k k