Generate a large number of $8-$puzzles instances and solve them $($where pos$-$sible$)$ by hill climbing $($steepest$-$ascent and first$-$choice variants$),$ hill climbing with ran$-$dom restart, and simulated annealing. Measure the search cost and percentage of solved problems and graph these against the optimal solution cost. Comment on your results.