Eight Queen Problem

The python file solves the 8 queen problem in chess, explained here: https://en.wikipedia.org/wiki/Eight_queens_puzzle

Method

I save the diagonals of the chess board into two dictionaries. I then write a function that takes some chess position as an input and outputs all the "attacked" ranges. I can then check if n positions/pieces attack each other. Finally, I build a nested-for-loop backtracking algorithm that places queens on the board one at a time, each in its own column. When 8 pieces do not attack each other, I print the result. 92 distinct solutions are found and printed!

In Progress

I am currently working on avoiding the nested for-loop by using recursion.