Solution for N Queen Puzzle and Knight's Tour (with GUI)
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general n queens problem of placing n non-attacking queens on an n×n chessboard, for which solutions exist for all natural numbers n with the exception of n=2 and n=3. ------ more about N-Queen Puzzle https://en.wikipedia.org/wiki/Eight_queens_puzzle
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open. ------ more about Knight's Tour https://en.wikipedia.org/wiki/Knight%27s_tour
https://github.com/kamoloff/NQueensPuzzle.git
