The infamous nqueens problem is used to find how many different ways queens can be arranged on an n x n chessboard such that none of the queens can hit eachother. This implementation uses the min-conflict algorithm to select a row for each queen.
Clone/download the project onto your computer and compile using CMake.
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate.