A modification of an 8 queens problem. Solves a chessboard for any number of queens where they don't touch diagnoally or horizontally on a chessboard. It then prints all possible combinations.
This repository is not active