Printable View
I'm trying to develop a program that gives a solution, if possible, for placing the minimum k queens on a chess board with n rows and n columns, where k < n, in such a way that some
queen attacks each cell using a stack. I know that I can't use recursion on this problem, but otherwise, I have no idea what to do. Any help would be much appreciated.
Are you trying to develop a brute force approach or do you have a strategy you can use?
I'm thinking a backtracking method, but I'm not quite sure if that's the best method for this problem.
If you want to discuss algorithms then you really need the algorithms & data structures forum.
Once you have the algorithm, if you need help implementing it ask here.