Description
- (50 points) Implement a 5-queens problem solver with Python 3 by using the hillclimbing algorithm and the genetic algorithm.
- I strongly recommend you follow the object-oriented programming style.
- Find n-queens.zip.
- Follow the specification
- The program should use the as the number of nonattacking pairs as the heuristic/fitness function.
- hill climb.py should perform the Hill-Climbing algorithm.
- py should perform the Genetic algorithm including the three operations, i.e., selection, crossover, mutation to find a solution.
- The program should track the number of required steps (no steps) to solve a problem.
- The program should output a solution and be terminated.
- An expected output format.
The number of required steps: 5
1 – – – –
- – – 1 –
- 1 – – –
- – – – 1
- – 1 – –
- Submit n-queens.zip that includes your solutions, i.e., hill climb.py and py.
