Solving n-queens with a genetic algorithm and its usefulness in a computational intelligence course
Richard Eastridge, Cecil Schmidt · Journal of computing sciences in colleges · 2008
Applying genetic algorithm techniques to the classic n-Queens problem illustrates the effectiveness and power of using an evolutionary approach to constraint satisfaction problems whose solutions cannot be found in polynomial time. When applied to problem-solving, genetic algorithms provide a means to emulate the natural evolutionary process in an attempt to reach an acceptable solution. This research reports on the application of the natural evolutionary process towards the solving of the n-Queens problem and the usefulness of such a problem in teaching computational intelligent algorithms.