There are 9!/2 solvable positions in the usual 8-puzzle [5]. Then we simulated the heuristic values h(n) by corrupting the optimal values in two steps. In the ...
確定! 回上一頁