A simple python code which reduces the N Queen Problem to Boolean Satisfiability Problem.
- Python 3
- minisat solver from https://github.com/niklasso/minisat
- tkinter for the GUI display
Just install the minisat solver in your preferred linux distro. After that just execute the python file.
The program accepts both command line input or prompts the user for input if no CLI argument is passed.
Just enter Chessboard Size.