write a program in java that can solve the 8 queen problem using Hill Climbing.

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.

The solution to the problem is a state where no 2 queens are attacking each other.

For local search, the cost function would be the number of attacking queens.

For CSP, again, you'll need to formulate the problem. How to implement the constraint checking for this problem.