main_queens.py

from search.Problems import *
from search.local_search import *


# formulate the problem
problem = EightQueensProblem()

# search algorithm
search = HillClimbing(problem=problem)

# run algorithm
result, state = search.run()

# display the solutions
print(search)
print(result)
print(problem.value(state))
print(state)
problem.print_chess(state)

# search algorithm
search = SimulatedAnnealing(problem=problem, max_time=1000, lam=0.01)

# run algorithm
result, state = search.run()

# display the solutions
print(search)
print(result)
print(problem.value(state))
print(state)
problem.print_chess(state)

# search algorithm
search = Genetic(problem=problem, population=50, generations=100, p_mutation=0.1, gene_pool=list(range(8)))

# run algorithm
result, state = search.run()

# display the solutions
print(search)
print(result)
print(problem.value(state))
print(state)
problem.print_chess(state)