This assignment is to write a program that can solve the 8 queen problem using Hill Climbing.

Use simulated annealing

The program can be in a language of your choice. Assume that each state is represented as an 8 integer array Q = [q_1, q_2, q_3, q_4, q_5, q_6, q_7, q_8], where each q_i is an integer between 1 and 8, and represents the row that the ith queen is on.

From a given state Q, we can go to different state Q', by changing just any one of the q_i's.

The value of any state value(state) is equal to -cost(state), where cost(state) is the number of attacking queens.