"uniqe" practice for 8 qeens problem
Hi all,
I'm trying to do a lab assignment for a 8 qeens problem:
"There are 92 posts that are possible for 8 queens on board - chess, so they do not threaten each other.In this task You will have to get a whole number 'n' between 1 and 92 (includes 1 - 92), and print the 'n' solution in the all Possible solutions. Ie: if the input number detected is 5, will be printed only the fifth solution,in all Possible solutions. If the number is 6, will print only the sixth solution, etc..
Instructions:
You have to use one-dimensional array to keep the current board situation: in the - i cell saved the column that The i+1 Queen was set. Ie: no. column in which the first Queen set will be 0, no. column in which the second Queen set will be 1, etc..
A simple solution for the problem is possible by useing - 8 nested loops. Note: In this exercise you forbidden to use - 8 nested loops."
I'm trying to it for a week now and no success, plz help :(