Generate a large number of 8-puzzle and 8-queens instances and solve them by hill climbing (steepest-ascent and first-choice variants), hill climbing with random restart, and simulated annealing. Measure the search cost and percentage of solved problems and graph these against the optimal solution cost.
Detail analysis and results here.
生成大量的八数码问题和八皇后问题并用以下算法分别求解：爬山法（最陡上升和首选爬山法），随机重启爬山法，模拟退火算法。计算搜索耗散和问题的解决率，并用图对比它们的最优解代价的曲线。对结果进行评估。
详细的分析和结果在这里。