Learning and practicing programming languages
This is a collection of solutions to the N Queen Problem, the general case of the 8 Queen Problem. Recursive backtracking is employed in all of the solutions. In each folder, instructions on how to run, together with the source code, is provided.
This project is heavily inspired by Joe Wingbermuehle's maze generation algorithms. Thanks, Joe!