N - Knights Problem

Problem Statement We have to place N number of Knights in a NxN matrix, such that no 2 knights cross each other's path in any way. This Problem is to be solved using Recursion and Backtracking. It is really similar to N - Queens Problem Ways for a K...