Description: 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.
To Search:
File list (Check if you may need any files):
GAlgorethms\Debug\GAlgorethms.exe
...........\GAlgorethms\Debug\GAlgorethms.log
...........\...........\.....\............tlog\CL.read.1.tlog
...........\...........\.....\................\CL.write.1.tlog
...........\...........\.....\................\GAlgorethms.lastbuildstate
...........\...........\.....\................\link.read.1.tlog
...........\...........\.....\................\link.write.1.tlog
...........\...........\.....\Genetic_Algorithms.obj
...........\...........\.....\Source.obj
...........\...........\.....\vc120.idb
...........\...........\.....\vc120.pdb
...........\...........\GAlgorethms.vcxproj
...........\...........\GAlgorethms.vcxproj.filters
...........\...........\Genetic_Algorithms.cpp
...........\...........\Genetic_Algorithms.h
...........\...........\Source.cpp
...........\GAlgorethms.sln
...........\GAlgorethms.v12.suo
...........\...........\Debug\GAlgorethms.tlog
...........\...........\Debug
...........\Debug
...........\GAlgorethms
GAlgorethms
Download