Principles of artificial intelligence
Principles of artificial intelligence
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Probabilities and predicates in knowledge refinement
PKWBS-W'84 Proceedings of the 1984 IEEE conference on Principles of knowledge-based systems
| Hi-index | 0.00 |
A heuristic is good on a search space to the extent that it allows the prediction of which states are near to the goal. In this paper heuristics are investigated on several different search spaces. A measure is proposed for assessing the predictive accuracy of a given heuristic on a given search space. The measure sheds light on characteristics of the Traveling Salesman Problem that make it computationally more difficult to solve than the Minimum Spanning-Tree Problem.