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.
It can be tricky to solve the N-queens problem using a genetic algorithm in a reasonable amount of time. I can use a metaheuristic fitness function in my genetic algorithm so that it will reach a solution in a more reasonable amount of time.
I am an experienced software engineer with a degree in mathematics. I can help you with this.
Hi!
I'm interesting your project very well.
I am mastering c++ and I'm a good Mathematician.
And also I have many experience and good skill about algorithm development.
Let's go ahead with me
2 hours will be enough
I will give you the code in Python and you can convert that to your preferred language.
I will write functions to
1. Print the boards on screen
2. Print positions of the queens on the board as "Q"
3. Print remaining places on board as "X"
4. The boards will keep on printing until all positions have been displayed
5. At the end the total possible arrangements will be displayed as a number