Can N queens co-exist on an N by N chess board? If so how?
Python Shell
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
README.mkd
board_utils.py
gen_report.sh
nqueens.py
rr.py
test_nqueens.py
test_rr.py

README.mkd

N Queens

Calculate the unique number of solutions to the N-Queens problem for an NxN board.

usage:

python nqueens.py <number of queens>

Example:

python nqueens.py 4

Note: I was completely sober (seriously, @mythmon can confirm) while writing this code.

###Report If you want to see the report run the gen_report.sh script.

./gen_report.sh