Implementation of BFS alogorithm to solve N-Queen problem The problem: https://en.wikipedia.org/wiki/Eight_queens_puzzle User can choose the size of the board amount of "win" states to find an option to show all states explored