A program to solve N-ything problem in 8 x 8 chess board using 3 kind of algorithm:
- Hill Climbing Algorithm
- Simulated Annealing Algorithm
- Genetic Algorithm
- Enter the pawn that will be computed in the file src/test.txt.example
- Run src/main.py using the command: python main.py
- Enter the input file name (the default is test.txt.example)
- Enter the algorithm that will be used.
- For genetic algorithm, enter the number of genetic population and maximum iteration.
- The result will be shown on the screen.