Description: Backtracking is a systematic and both with a jump with a search algorithm that tree in the solution space in depth-first strategy to search the solution space starting from the root tree. Backtracking find all solutions of the problem, we should go back to the root, and root of all sub-trees have been searching all over until the end. Backtracking when seeking a solution to the problem, as long as the search for a solution to the problem would end. Using a retrospective method to solve the n queens problem, the solution space with a complete binary tree that, with the n-tuple x [1: n] said, where x [i] queen i said i-line on the board first x [i ] column, according to the rules of any two queen is not on the same row or column or the same diagonal, then the relationship can get the equation, which can solve the problem.
To Search:
File list (Check if you may need any files):
huisufa.txt
Download