A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Recent Progress in the Design and Analysis of Admissible Heuristic Functions
[chapter]
2000
Lecture Notes in Computer Science
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, with over ½¼ ½ states, and the ¢ sliding-tile puzzle, with almost ½¼ ¾ states, have been solved optimally. This progress is not the result of better search algorithms, but more effective heuristic evaluation functions. In addition, we have learned how to accurately predict the running time of admissible heuristic search
doi:10.1007/3-540-44914-0_3
fatcat:pgxu3psog5fappg5b3or4fggka