#n-queens This is a working solution to the classic N-Queens problem. There is a list of the execution times for up to eleven queens at the bottom of this readme. This project was worked on with Robin Kim.
1 queen: 0 ms
2 queens: 0 ms
3 queens: 0 ms
4 queens: 0 ms
5 queens: 2 ms
6 queens: 6 ms
7 queens: 36 ms
8 queens: 268 ms
9 queens: 2277 ms
10 queens: 20642 ms
11 queens: 150489 ms