This work gives a simple solver for the N-Queens Problem. We represent the board as a constraint satisfaction problem and find a valid solution using the backtracking algorithm. That no two queens can be in the same diagonal, row or column are the constraints to enforce. We represent these constraints in SymPy, a light-weight computer algebra system written in Python.
This works builds off of code from Udacity's Artificial Intelligence Nanodegree program.