11085 - Back to the 8-Queens
Solution Description : Backtracking (8-queen problem) At first find all possible combination of 8-queen using backtracking recursion and store all combination to array. You got 92 combination You need to searching for all 92 solutions and then determining the minimum number of moves by matching the board to each of these solutions. |
||||||||||