Originally the 8-Queens problem designed in the mid 1800's, this notebook tackles the slightly more complicated n-Queens problem. Here, a n x n board is placed with n queens in such a way that no queens can attack each other. In an attempt to solve this using evolutionary algorithms and genetic programming, the Distributed Evolutionary Algorithms in Python (DEAP) is utilized to find a possible solution.
This project was done in Python notebook and can be viewed alternatively in Jupyter's nbviewer for the best results.