In this project, an unconventional approach is used to find solutions to the generalized version of the Eight-queens puzzle - the n-queens puzzle. That is, placing n queens on an n × n chessboard such that no two queens are threatening each other. This problem has been previously solved using backtracking depth-first searches or efficient analytically-derived algorithms. The results of this notebook show it is possible to find a single solution to the n-queens problem for moderate values of n (up to n = 64, a 10^90 search space) by using evolutionary algorithms and genetic programming.
While GitHub supports rendering Jupyter Notebook projects, it does not support rendering them as default README page. Furthermore, there are performance issues when rendering non-trivial notebooks. For best results, the notebook can be viewed using Jupyter's nbviewer.