Solving the N Queen problem without Backtracking
The N Queen Problem is the typical Computer Science university problem for any algorithm course. You have to arrange N Queens on an NxN chessboard such that they don't attack each other. It can typically be solved using Backtracking but in this ...
