Which of the following methods can be used to solve n-queen’s problem?
(a) greedy algorithm
(b) divide and conquer
(c) iterative improvement
I got this question by my school teacher while I was bunking the class.
The question is from Backtracking in chapter Backtracking of Data Structures & Algorithms II