You are suggested to use recursive techniques to solve this problem. the ith queen's placement at the current grid position is dependent on whether all the following i+1(th) to (n-1)th queens can find their positions. note that in c, an array starts with index 0, so the (n-1)th queen is the last one. here is some pseudocode to get you started, which you should stick as closely as possible to when implementing your solution. the definition of n controls the size of the grid: