Introduction - If you have any usage issues, please Google them yourself
N-Queens problem
Using backtracking (recursive), GA algorithm, and CSP minimal conflict solving n-Queens problem.
Namely, how can the NxN chessboard of placing n Queens on, which makes it a Queen cannot directly eat other Queen? To this end, two Queens cannot be in the same hands, on a vertical or diagonal.
Requirements:
I. Enter n, with a running time of several questions the efficiency of algorithms in the same size, and gave results list.
II. when comparing the same algorithm in n different running time, analyzing the time complexity of the algorithm and the list gives the result.