I need help on my computer science homework. The question involves generating a large number of 8 puzzle and 8 queen instances and I'm having trouble figuring out what to do here. Here is the problem:

How do I do this? For code use Java please.

1. Generate a large number of 8-puzzle and 8-queens instances and solve them (where possible) by hill climbing [ 20 points], and hill climbing with random restart [20 points]. Measure the search cost and percentage of solved problems and graph these against the optimal solution cost. Comment on your results (which method is faster in solving the problems and why?, which method has the higher rate of problems solved and why?)