chess game expert

8-queens problem – how to put eight queens on a chessboard so that no queen is attacking another one. The problem can be generalized to different sizes of chessboard – how can N queens be placed on an NxN chessboard so that none are being attacked. Now, you are to implement a genetic algorithm solution to solve the sixteen queens problem. You can implement code in Java, C++ or Python. You are not to use any canned search algorithms; you must implement the classes that make up the GA solver. I have implemented the SixteenQueensBoard and SixteenQueensSolver classes , but you will need to implement the rest.